Abstract
Purchase PDF (1766 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (143)
Purchase PDF (411 K)
doi:10.1016/S0306-4379(99)00003-4 
Copyright © 1999 Published by Elsevier Science Ltd.
Efficient mining of association rules using closed itemset lattices*1
Received 13 June 1998;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Discovering association rules is one of the most important task in data mining. Many efficient algorithms have been proposed in the literature. The most noticeable are Apriori, Mannila's algorithm, Partition, Sampling and DIC, that are all based on the Apriori mining method: pruning the subset lattice (itemset lattice). In this paper we propose an efficient algorithm, called Close, based on a new mining method: pruning the closed set lattice (closed itemset lattice). This lattice, which is a sub-order of the subset lattice, is closely related to Wille's concept lattice in formal concept analysis. Experiments comparing Close to an optimized version of Apriori showed that Close is very efficient for mining dense and/or correlated data such as census style data, and performs reasonably well for market basket style data.
Author Keywords: Data Mining; Knowledge Discovery; Association Rules; Data Clustering; Lattices; Algorithms
