Efficiently Mining Maximal Frequent Patterns from Traversals on Weighted Directed Graph Using Statistical Theory

To solve the problem of mining weighted patterns with noisy weight from traversals on weighted directed graph (WDG), an effective algorithm, called SMaxWFPMiner (Statistical theory-based maximal weighted frequent patterns miner), is proposed. The algorithm undergoes two phases to discover MaxWFP from the traversals on WDG. In the first phase, it adopts the weightpsilas confidence level (CL) to remove the vertices with noisy weights, which reduce remarkably the size of traversal database (TDB). In the second phase, incorporating the maximal property with weight constrains, it exploits a weighted FP-tree approach to reduce effectively search space and extract succinct and lossless patterns from weighted graph TDB. Experimental comparison results show that the algorithm is efficient and scalable for mining MaxWFPs based on traversals on the WDG.

[1]  Ada Wai-Chee Fu,et al.  Mining association rules with weighted items , 1998, Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156).

[2]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[3]  Philip S. Yu,et al.  Efficient mining of weighted association rules (WAR) , 2000, KDD '00.

[4]  Francesco Bonchi,et al.  On closed constrained frequent pattern mining , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).

[5]  Philip S. Yu,et al.  Efficient Data Mining for Path Traversal Patterns , 1998, IEEE Trans. Knowl. Data Eng..

[6]  G. Grahne,et al.  High Performance Mining of Maximal Frequent Itemsets Gösta , 2003 .

[7]  Mohammed J. Zaki,et al.  Efficient algorithms for mining closed itemsets and their lattice structure , 2005, IEEE Transactions on Knowledge and Data Engineering.

[8]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[9]  Runian Geng,et al.  Efficiently Mining Closed Frequent Patterns with Weight Constraint from Directed Graph Traversals Using Weighted FP-Tree Approach , 2008, 2008 ISECS International Colloquium on Computing, Communication, Control, and Management.

[10]  Mohammed J. Zaki,et al.  Efficiently mining maximal frequent itemsets , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[11]  Jian Pei,et al.  CLOSET+: searching for the best strategies for mining frequent closed itemsets , 2003, KDD '03.

[12]  Yannis Manolopoulos,et al.  Mining patterns from graph traversals , 2001, Data Knowl. Eng..

[13]  Mohammed J. Zaki,et al.  CHARM: An Efficient Algorithm for Closed Itemset Mining , 2002, SDM.