Pushing support constraints into association rules mining
- 13 May 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 15 (3), 642-658
- https://doi.org/10.1109/tkde.2003.1198396
Abstract
Interesting patterns often occur at varied levels of support. The classic association mining based on a uniform minimum support, such as Apriori, either misses interesting patterns of low support or suffers from the bottleneck of itemset generation caused by a low minimum support. A better solution lies in exploiting support constraints, which specify what minimum support is required for what itemsets, so that only the necessary itemsets are generated. We present a framework of frequent itemset mining in the presence of support constraints. Our approach is to "push" support constraints into the Apriori itemset generation so that the "best" minimum support is determined for each itemset at runtime to preserve the essence of Apriori. This strategy is called Adaptive Apriori. Experiments show that Adapative Apriori is highly effective in dealing with the bottleneck of itemset generation.Keywords
This publication has 15 references indexed in Scilit:
- Finding interesting associations without support pruningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Mining frequent patterns without candidate generationPublished by Association for Computing Machinery (ACM) ,2000
- Extending naïve Bayes classifiers using long itemsetsPublished by Association for Computing Machinery (ACM) ,1999
- Efficient mining of emerging patternsPublished by Association for Computing Machinery (ACM) ,1999
- Mining association rules with multiple minimum supportsPublished by Association for Computing Machinery (ACM) ,1999
- Exploratory mining and pruning optimizations of constrained associations rulesPublished by Association for Computing Machinery (ACM) ,1998
- Efficiently mining long patterns from databasesACM SIGMOD Record, 1998
- Dynamic itemset counting and implication rules for market basket dataPublished by Association for Computing Machinery (ACM) ,1997
- Beyond market basketsPublished by Association for Computing Machinery (ACM) ,1997
- An effective hash-based algorithm for mining association rulesACM SIGMOD Record, 1995