Mining frequent patterns without candidate generation
Top Cited Papers
- 16 May 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Efficient mining of constrained correlated setsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Tree Projection Algorithm for Generation of Frequent Item SetsJournal of Parallel and Distributed Computing, 2001
- Efficient mining of emerging patternsPublished by Association for Computing Machinery (ACM) ,1999
- Efficiently mining long patterns from databasesPublished by Association for Computing Machinery (ACM) ,1998
- Integrating association rule mining with relational database systemsPublished by Association for Computing Machinery (ACM) ,1998
- Exploratory mining and pruning optimizations of constrained associations rulesPublished by Association for Computing Machinery (ACM) ,1998
- Discovery of Frequent Episodes in Event SequencesData Mining and Knowledge Discovery, 1997
- Beyond market basketsPublished by Association for Computing Machinery (ACM) ,1997
- An effective hash-based algorithm for mining association rulesPublished by Association for Computing Machinery (ACM) ,1995
- Finding interesting rules from large sets of discovered association rulesPublished by Association for Computing Machinery (ACM) ,1994