Mining frequent patterns by pattern-growth
- 1 December 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGKDD Explorations Newsletter
- Vol. 2 (2) , 14-20
- https://doi.org/10.1145/380995.381002
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Tree Projection Algorithm for Generation of Frequent Item SetsJournal of Parallel and Distributed Computing, 2001
- FreeSpanPublished by Association for Computing Machinery (ACM) ,2000
- Can we push more constraints into frequent pattern mining?Published by Association for Computing Machinery (ACM) ,2000
- Mining frequent patterns without candidate generationPublished by Association for Computing Machinery (ACM) ,2000
- Efficient mining of emerging patternsPublished by Association for Computing Machinery (ACM) ,1999
- Bottom-up computation of sparse and Iceberg CUBEPublished by Association for Computing Machinery (ACM) ,1999
- Optimization of constrained frequent set queries with 2-variable constraintsPublished by Association for Computing Machinery (ACM) ,1999
- Efficiently mining long patterns from databasesPublished by Association for Computing Machinery (ACM) ,1998
- Exploratory mining and pruning optimizations of constrained associations rulesPublished by Association for Computing Machinery (ACM) ,1998
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993