The Community for Technology Leaders
Green Image
The set of frequent closed itemsets uniquely determines the exact frequency of all itemsets, yet it can be orders of magnitude smaller than the set of all frequent itemsets. In this paper, we present CHARM, an efficient algorithm for mining all frequent closed itemsets. It enumerates closed sets using a dual itemset-tidset search tree, using an efficient hybrid search that skips many levels. It also uses a technique called diffsets to reduce the memory footprint of intermediate computations. Finally, it uses a fast hash-based approach to remove any "nonclosed” sets found during computation. We also present CHARM-L, an algorithm that outputs the closed itemset lattice, which is very useful for rule generation and visualization. An extensive experimental evaluation on a number of real and synthetic databases shows that CHARM is a state-of-the-art algorithm that outperforms previous methods. Further, CHARM-L explicitly generates the frequent closed itemset lattice.
Closed itemsets, frequent itemsets, closed itemset lattice, association rules, data mining.
Mohammed J. Zaki, Ching-Jui Hsiao, "Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure", IEEE Transactions on Knowledge & Data Engineering, vol. 17, no. , pp. 462-478, April 2005, doi:10.1109/TKDE.2005.60
104 ms
(Ver 3.3 (11022016))