A confidence-lift support specification for interesting associations mining

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2336, Issue , 2002, Pages 148-158

  Lin, Wen Yang ^a   Tseng, Ming Cheng ^a   Su, Ja Hwung ^a  

^a I SHOU UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS;

ASSOCIATION RULES MINING; COMBINATORIAL EXPLOSION; HIGH CONFIDENCE; ITEM SETS; REAL-WORLD;

DATA MINING;

EID: 84945299663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47887-6_14     Document Type: Conference Paper

References (12)

1. Agrawal, R., Imielinski T., Swami, A.: Mining association rules between sets of items in large databases. Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data. Washington, D.C. (1993) 207-216
2. Aggarwal, C. C., Yu, P. S.: A new framework for itemset generation. Proc. 17th ACM Symp. Principles of Database Systems. Seattle, WA (1998) 18-24
3. Berry, J. A., Linoff, G. S.: Data Mining Techniques for Marketing, Sales and Customer Support. John Wiley & Sons, Inc. (1997)
4. Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: generalizing association rules to correlations. Proc. 1997 ACM-SIGMOD Int. Conf. Management of Data. (1997) 265-276
5. Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamicit emset counting and implication rules for market-basket data. Proc. 1997 ACM-SIGMOD Int. Conf. Management of Data. (1997) 207-216
6. Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J. D., Yang, C.: Finding Interesting associations without support pruning. Proc. IEEE Int. Conf. Data Engineering. (2000) 489-499
7. Han, J., Fu, Y.: Discovery of multiple-level association rules from large databases. Proc. 21st Int. Conf. Very Large Data Bases. Zurich, Swizerland (1995) 420-431
8. Li, J., Zhang, X.: Efficient mining of high confidence association rules without support thresholds. Proc. 3rd European Conf. Principles and Practice of Knowledge Discovery in Databases. Prague (1999)
9. Liu, B., Hsu, W., Ma, Y.: Mining association rules with multiple minimum supports. Proc. 1999 ACM-SIGKDD Int. Conf. Knowledge Discovery and Data Mining. San Deigo, CA (1999) 337-341
10. Seno, M., Karypis, G.: LPMiner: An algorithm for finding frequent intemsets using length-decreasing Support constraint. Proc. 1st IEEE Int. Conf. Data Mining. (2001)
11. Tseng, M.-C., Lin, W.-Y.: Mining generalized association rules with multiple minimum supports. Proc. Int. Conf. Data Warehousing and Knowledge Discovery. Munich, Germany (2001) 11-20
12. Wang, K., He, Y., Han, J.: Mining frequent itemsets using support constraints. Proc. 26th Int. Conf. Very Large Data Bases. Cario, Egypt (2000) 43-52