Constrained frequent pattern mining
- 1 June 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGKDD Explorations Newsletter
- Vol. 4 (1) , 31-39
- https://doi.org/10.1145/568574.568580
Abstract
It has been well recognized that frequent pattern mining plays an essential role in many important data mining tasks. However, frequent pattern mining often generates a very large number of patterns and rules, which reduces not only the efficiency but also the effectiveness of mining. Recent work has highlighted the importance of the constraint-based mining paradigm in the context of mining frequent itemsets, associations, correlations, sequential patterns, and many other interesting patterns in large databases.Recently, we developed efficient pattern-growth methods for frequent pattern mining. Interestingly, pattern-growth methods are not only efficient but also effective in mining with various constraints. Many tough constraints which cannot be handled by previous methods can be pushed deep into the pattern-growth mining process. In this paper, we overview the principles of pattern-growth methods for constrained frequent pattern mining and sequential pattern mining. Moreover, we explore the power of pattern-growth methods towards mining with tough constraints and highlight some interesting open problems.Keywords
This publication has 16 references indexed in Scilit:
- H-mine: hyper-structure mining of frequent patterns in large databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- CHARM: An Efficient Algorithm for Closed Itemset MiningPublished by Society for Industrial & Applied Mathematics (SIAM) ,2002
- Mining frequent patterns by pattern-growthACM SIGKDD Explorations Newsletter, 2000
- FreeSpanPublished 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
- Exploratory mining and pruning optimizations of constrained associations rulesPublished by Association for Computing Machinery (ACM) ,1998
- An effective hash-based algorithm for mining association rulesPublished by Association for Computing Machinery (ACM) ,1995