SWFTPMiner: Mining Weighted Frequent Patterns from Graph Traversals with Noisy Information
Runian Geng, Xiangjun Dong, Jing Zhao, Wenbo Xu · 2008
To solve the problem of mining weighted frequent traversal patterns (WFTPs) with noisy weight information from weighted directed graph (WDG), an effective algorithm called SWFTPMiner (statistical theory-based weighted frequent traversal patterns miner) is developed. It first adopts statistical notion called confidence interval (CI) to delete the vertices with noisy weights from the traversal database (TDB), which reduce remarkably the size of TDB and the number of candidate patterns. Then the algorithm explores two mining strategies, respectively called level-wise strategy and divide-and-conquer strategy, to mine the WFTPs in mining process. Experimental results show: (1) Taking CI into consideration, we can discover more reliable WFTPs. (2) Algorithm SWFTPMiner is effective and scalable. The algorithm can be applied to various applications which can be modeled as a WDG.