Efficiently Mining of Maximal Frequent Item Sets Based on FP-Tree

During the process of mining maximal frequent item sets, when minimum support is little, superset checking is a kind of time-consuming and frequent operation in the mining algorithm. In this paper, a new algorithm FPMFI (frequent pattern tree for maximal frequent item sets) for mining maximal frequent item sets is proposed. It adopts a new superset checking method based on projection of the maximal frequent item sets, which efficiently reduces the cost of superset checking. In addition, FPMFI also compresses the conditional FP-Tree (frequent pattern tree) greatly by deleting the redundant information, which can reduce the cost of accessing the tree. It is proved by theoretical analysis that FPMFI has superiority and it is revealed by experimental comparison that the performance of FPMFI is superior to that of the similar algorithm based on FP-Tree more than one time.

[1]  Roberto J. Bayardo,et al.  Efficiently mining long patterns from databases , 1998, SIGMOD '98.

[2]  Zhu Yu-quan,et al.  An Algorithm and Its Updating Algorithm Based on FP-Tree for Mining Maximum Frequent Itemsets , 2003 .

[3]  Song Yu.  An Algorithm and Its Updating Algorithm Based on FP-Tree for Mining Maximum Frequent Itemsets , 2003 .

[4]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[5]  Lu Song.  Fast Mining Maximum Frequent Itemsets , 2001 .

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

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

[8]  Johannes Gehrke,et al.  MAFIA: a maximal frequent itemset algorithm for transactional databases , 2001, Proceedings 17th International Conference on Data Engineering.

[9]  Ramesh C Agarwal,et al.  Depth first generation of long patterns , 2000, KDD '00.

[10]  Yan Yue,et al.  Frequent Item Sets Mining Algorithms , 2004 .

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

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

[13]  Wesley W. Chu,et al.  SmartMiner: a depth first algorithm guided by tail information for mining maximal frequent itemsets , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[14]  Hui Wang,et al.  Parallel Algorithm for Mining Maximal Frequent Patterns , 2003, APPT.