This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Pushing Support Constraints Into Association Rules Mining
May/June 2003 (vol. 15 no. 3)
pp. 642-658

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. In this paper, 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 Adapative Apriori. Experiments show that Adapative Apriori is highly effective in dealing with the bottleneck of itemset generation.

[1] C.C. Aggarwal and P.S. Yu, “A New Framework for Itemset Generation,” Proc. ACM Principles of Database Systems Conf., 1998.
[2] R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules Between Sets of Items in Large Databases,” Proc. 1993 ACM-SIGMOD Int'l Conf. Management of Data, pp. 207-216, May 1993.
[3] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 1994 Int'l Conf. Very Large Data Bases, pp. 487-499, Sept. 1994.
[4] R.J. Bayardo, “Efficiently Mining Long Patterns From Databases,” ACM SIGMOD Conf. Management of Data, June 1998.
[5] S. Brin, R. Motwani, and C. Silverstein, “Beyond Market Basket: Generalizing Association Rules to Correlations,” Proc. 1997 ACM-SIGMOD Int'l Conf. Management of Data, pp. 265-276, May 1997.
[6] S. Brin, R. Motwani, J. Ullman, and S. Tsur, “Dynamic Itemset Counting and Implication Rules for Market Basket Data,” ACM SIGMOD Conf. Management of Data, May 1997.
[7] E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, and C. Yang, “Finding Interesting Associations without Support Pruning,” Proc. 16th Int'l Conf. Data Eng., pp. 489-500, 2000.
[8] G. Dong and J. Li, “Efficient Mining of Emerging Patterns: Discovering Trends and Differences,” Proc. Fifth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 43-52, Aug. 1999.
[9] J. Han and Y. Fu, “Discovery of Multiple-Level Association Rules from Large Databases,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 420-431, Sept. 1995.
[10] J. Han, J. Pei, and Y. Yin, Mining Frequent Patterns without Candidate Generation Proc. ACM SIGMOD Conf. Management of Data (SIGMOD '00), pp. 1-12, 2000.
[11] W. Lee, S. Stolfo, and K. Mok, “Mining Audit Data to Build Intrusion Detection Models,” Knowledge Discovery in Databases, pp. 66-72, Sept. 1998.
[12] B. Liu, W. Hsu, and Y. Ma, “Integrating Classification and Association Rule Mining,” Knowledge Discovery in Databases, pp. 80-86, Sept. 1998.
[13] B. Liu, W. Hsu, and Y. Ma, “Mining Association Rules with Multiple Minimum Supports,” Proc. Fifth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 125-134, Sept. 1999.
[14] H. Mannila, H. Toivonen, and A. Verkamo, “Efficient Algorithm for Discovering Association Rules,” Knowledge Discovery in Databases, pp.181-192, Sept. 1994.
[15] D. Meretakis and B. Wuthrich, “Extending Naive Bayes Classifiers Using Long Itemsets,” Proc. Fifth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 165-174, Aug. 1999.
[16] R. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang, “Exploratory Mining and Pruning Optimizations of Constrained Associations Rules,” Proc. 1998 ACM-SIGMOD Int'l Conf. Management of Data, pp. 13-24, June 1998.
[17] J.S. Park, M.S. Chen, and P.S. Yu, “An Effective Hash-Based Algorithm for Mining Association Rules,” Proc. 1995 ACM-SIGMOD Int'l Conf. Management of Data, pp. 175-186, May 1995.
[18] R. Rymon, “Search through Systematic Set Enumeration,” Principles of Knowledge Representation and Reasoning, pp. 539-550, 1992.
[19] A. Savasere, E. Omiecinski, and S. Navathe, “An Efficient Algorithm for Mining Association Rules in Large Databases,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 432-443, Sept. 1995.
[20] C. Silverstein, S. Brin, R. Motwani, and J. Ullman, “Scalable Techniques for Mining Causal Structures,” Proc. 1998 Int'l Conf. Very Large Data Bases, pp. 594-605, Aug. 1998.
[21] R. Srikant and R. Agrawal, “Mining Generalized Association Rules,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 407-419, Sept. 1995.
[22] R. Srikant, Q. Vu, and R. Agrawal, “Mining Association Rules with Item Constraints,” Knowledge Discovery in Databases, pp. 67-73, Aug. 1997.
[23] P. Resnick and H. Varian, "Recommender Systems," Comm. ACM, Vol. 40, No. 3, Mar. 1997, pp. 56-58.
[24] K. Wang, Y. He, and J. Han, “Pushing Support Constraints into Frequent Itemset Mining,” Proc. Very Large Data Bases Conf. (VLDB), pp. 43-52, Sept. 2000.
[25] K. Wang, S. Zhou, and S. Liew, “Building Hierarchical Classifiers Using Class Proximity,” Proc. Very Large Data Bases Conf. (VLDB), pp. 363-374, Sept. 1999.

Index Terms:
Association rules, constraints, data mining, frequent itemsets, knowledge discovery.
Citation:
Ke Wang, Yu He, Jiawei Han, "Pushing Support Constraints Into Association Rules Mining," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 3, pp. 642-658, May-June 2003, doi:10.1109/TKDE.2003.1198396
Usage of this product signifies your acceptance of the Terms of Use.