The Community for Technology Leaders
Green Image
Issue No. 10 - October (2005 vol. 17)
ISSN: 1041-4347
pp: 1347-1362
Efficient algorithms for mining frequent itemsets are crucial for mining association rules as well as for many other data mining tasks. Methods for mining frequent itemsets have been implemented using a prefix-tree structure, known as an FP-tree, for storing compressed information about frequent itemsets. Numerous experimental results have demonstrated that these algorithms perform extremely well. In this paper, we present a novel FP-array technique that greatly reduces the need to traverse FP-trees, thus obtaining significantly improved performance for FP-tree-based algorithms. Our technique works especially well for sparse data sets. Furthermore, we present new algorithms for mining all, maximal, and closed frequent itemsets. Our algorithms use the FP-tree data structure in combination with the FP-array technique efficiently and incorporate various optimization techniques. We also present experimental results comparing our methods with existing algorithms. The results show that our methods are the fastest for many cases. Even though the algorithms consume much memory when the data sets are sparse, they are still the fastest ones when the minimum support is low. Moreover, they are always among the fastest algorithms and consume less memory than other methods when the data sets are dense.
Index Terms- Data mining, association rules.

G. Grahne and J. Zhu, "Fast Algorithms for Frequent Itemset Mining Using FP-Trees," in IEEE Transactions on Knowledge & Data Engineering, vol. 17, no. , pp. 1347-1362, 2005.
93 ms
(Ver 3.3 (11022016))