mining weighted frequent patterns using local graph linking information
geng runian1，2,dong xiangjun2,zhang ping1,3, xu wenbo1
(1.school of information technology, jiangnan university, wuxi jiangsu 214122, china；2.school of information science & technology, shandong institute of light industry, jinan 250353, china;3.china ship scientific research center, wuxi jiangsu 214082, china)abstract:data mining for traversal patterns has been found useful in several applications. however, traditional model of traversal patterns mining only considered unweighted traversals.this paper proposed a transformable model of ewdg (edgeweighted directed graph) and vwdg (vertexweighted directed graph)to resolve the problem of weighted traversal patterns mining. based on the model,developed a new algorithm,called lgtwfpminer(local graph traversalsbased weighted frequent patterns miner), and its local estimation of support/weightbound to discover weighted frequent patterns from the traversals on graph with a level property. experimental results of synthetic data show the algorithm is effective to resolve the problem of mining weighted frequent patterns based on graph traversals. ......