In recent years, the weakness of the canonical support-confidence framework for associations mining has been widely studied. One of the difficulties in applying association rules mining is the setting of support constraints. A high-support constraint avoids the combinatorial explosion in discovering frequent itemsets, but at the expense of missing interesting patterns of low support. Instead of seeking a way to set the appropriate support constraints, all current approaches leave the users in charge of the support setting, which, however, puts the users in a dilemma. This paper is an effort to answer this long-standing open question. According to the notion of confidence and lift measures, we propose an automatic support specification for efficiently mining high-confidence and positive-lift associations without consulting the users. Experimental results show that the proposed method is not only good at discovering high-confidence and positive-lift associations, but also effective in reducing spurious frequent itemsets.
R. Agrawal , T. Imielinski and A. Swami , Mining association rules between sets of items in large databases . In: P. Buneman and S. Jajodia (eds), Proceedings of the 1993 ACM-SIGMOD International Conference on Management of Data, 26-28 May 1993 (ACM Press, Washington, DC, 1993) 207-216 .
2.
J. A. Berry and G. S. Linoff , Data Mining Techniques for Marketing, Sales and Customer Support ( John Wiley & Sons, New York , 1997).
3.
S. Brin , R. Motwani , J. D. Ullman and S. Tsur , Dynamic itemset counting and implication rules for market-basket data . In: J. Peckham (ed.), Proceedings of 1997 ACM-SIGMOD International Conference on Management of Data 13-15 May 1997 (ACM Press, Tucson, 1997) 207-216 .
4.
J. Han and Y. Fu , Discovery of multiple-level association rules from large databases . In: U. Dayalet al. (eds), Proceedings of the 21st International Conference on Very Large Data Bases 11-15 September 1995 (Morgan Kaufmann, Zurich, 1995) 420-431 .
5.
B. Liu , W. Hsu and Y. Ma , Mining association rules with multiple minimum supports . In: A. Deliset al. (eds), Proceedings of the 1999 ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, 1-3 June (ACM Press, Philadelphia, 1999) 337-341 .
6.
M. C. Tseng and W. Y. Lin , Mining generalized association rules with multiple minimum supports . In: Y. Kambayashiet al. (eds), Proceedings of the International Conference on Data Warehousing and Knowledge Discovery, 5-7 September 2001 (Springer, Munich, 2001) 11-20 .
7.
K. Wang , Y. He and J. Han , Mining frequent itemsets using support constraints . In: A. E. Abbadiet al. (eds), Proceedings of the 26th International Conference on Very Large Data Bases, 10-14 September 2000 (Morgan Kaufmann, Cairo, 2000) 43-52 .
8.
M. Seno and G. Karypis , LPMiner: an algorithm for finding frequent itemsets using length-decreasing support constraint . In: N. Cerconeet al. (eds), Proceedings of the 1st IEEE International Conference on Data Mining, 29 November to 2 December 2001 (IEEE, San Jose, CA, 2001) 505-512 .
9.
J. Li and X. Zhang , Efficient mining of high confidence association rules without support thresholds . In: J. M. Zytkow and J. Rauch (eds), Proceedings of the 3rd European Conference on Principles and Practice of Knowledge Discovery in Databases, 15-19 September 1999 (Springer, Prague, 1999) 406-411 .
10.
C. C. Aggarwal and P. S. Yu , A new framework for itemset generation . In: A. Mendelson and J. Paredaens (eds), Proceedings of the 17th ACM Symposium on Principles of Database Systems, 1-4 June 1998 (ACM Press, Seattle, 1998) 18-24 .
11.
S. Brin , R. Motwani and C. Silverstein , Beyond market baskets: generalizing association rules to correlations . In: J. Peckham (ed.), Proceedings of 1997 ACM-SIGMOD International Conference on Management of Data 13-15 May 1997 (ACM Press, Tucson, 1997) 265-276 .
12.
E. Cohen , M. Datar , S. Fujiwara , A. Gionis , P. Indyk , R. Motwani , J. D. Ullman and C. Yang , Finding interesting associations without support pruning , IEEE Transactions on Knowledge and Data Engineering13(1) (2001) 64-78 .
13.
R. Agrawal and R. Srikant , Fast algorithms for mining association rules . In: J. B. Boccaet al. (eds), Proceedings of the 20th International Conference on Very Large Data Bases, 12-15 September 1994 (Morgan Kaufmann, Santiago, 1994) 487-499 .
14.
MPC (Minnesota Population Center), University of Minnesota, IPUMS-USA. Available at: www.ipums.umn.edu (accessed 4 November 2005).
