Efficiently mining maximal frequent itemsets
Top Cited Papers
- 14 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 163-170
- https://doi.org/10.1109/icdm.2001.989514
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- MAFIA: a maximal frequent itemset algorithm for transactional databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Depth first generation of long patternsPublished by Association for Computing Machinery (ACM) ,2000
- 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
- Efficiently mining long patterns from databasesPublished by Association for Computing Machinery (ACM) ,1998
- An algorithm for dynamic subset and intersection testingTheoretical Computer Science, 1994