CLOSET+
Top Cited Papers
- 24 August 2003
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 236-245
- https://doi.org/10.1145/956750.956779
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Mining frequent item sets by opportunistic projectionPublished by Association for Computing Machinery (ACM) ,2002
- CHARM: An Efficient Algorithm for Closed Itemset MiningPublished by Society for Industrial & Applied Mathematics (SIAM) ,2002
- Real world performance of association rule algorithmsPublished by Association for Computing Machinery (ACM) ,2001
- Generating non-redundant association rulesPublished by Association for Computing Machinery (ACM) ,2000
- Mining frequent patterns without candidate generationPublished by Association for Computing Machinery (ACM) ,2000
- Scalable parallel data mining for association rulesIEEE Transactions on Knowledge and Data Engineering, 2000
- Efficiently mining long patterns from databasesPublished by Association for Computing Machinery (ACM) ,1998
- Dynamic itemset counting and implication rules for market basket dataPublished by Association for Computing Machinery (ACM) ,1997
- An effective hash-based algorithm for mining association rulesPublished by Association for Computing Machinery (ACM) ,1995
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993