On support thresholds in associative classification

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2004, Pages 553-558

  Baralis, Elena ^a   Chiusano, Silvia ^a   Garza, Paolo ^a  

^a Dipartimento di Automatica e Informatica   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION ANALYSIS; INTEGER PROGRAMMING; KNOWLEDGE ACQUISITION; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY; STATISTICAL METHODS;

ASSOCIATIVE CLASSIFICATIONS; CLASSIFICATION ACCURACY; SPECIALIZATION; THRESHOLD SUPPORT;

DATA MINING;

EID: 2442589758     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/967900.968016     Document Type: Conference Paper

References (21)

1. R. Agrawal, T. Imilienski, and A. Swami. Mining association rules between sets of items in large databases. In SIGMOD'93.
2. E. Baralis and P. Garza. A lazy approach to pruning classification rules. In ICDM'02.
3. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining frequent patterns with counting inference. SIGKDD Explorations, December 2000.
4. R. J. Bayardo. Efficiently mining long patterns from databases. In ACM SIGMOD'99.
5. C. Blake and C. Merz. UCI repository of machine learning databases, 1998.
6. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery journal, 7(1), pp. 5-22, Kluwer Academics Publishers, May 2003.
7. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing associations rules to correlations. In ACM SIGMOD'97.
8. A. Bykowski and C. Rigotti. A condensed representation to find frequent patterns. In PODS'01.
9. B. Cremilleux and J.-F. Boulicaut. Simplest rules characterizing classes generated by delta-free sets. In ES'02.
10. G. Dong, X. Zhang, L. Wong, and J. Li. CAEP: Classification by aggregating emerging patterns. In Int. Conf. on Discovery Science, 1999.
11. E.Baralis and S. Chiusano. Minimal non redundant classification rule sets. IEEE ICDM Workshop on Foundations of Data Mining and Discovery, 2002.
12. W. Li, J. Han, and J. Pei. CMAR: Accurate and efficient classification based on multiple class-association rules. In ICDM'01.
13. B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule mining. In KDD'98.
14. B. Liu, Y. Ma, and K. Wong. Improving an association rule based classifier. In PKDD'00.
15. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemsets lattice. In Information Systems, 1999.
16. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Closed itemsets discovery of small covers for association rules. In Networking and Information Systems, June 2001.
17. J. Pei, J. Han, and R. Mao. Closet: An efficient algorithm for mining frequent closed itemsets. In ACM SIGMOD DMKD'00.
18. J. Quinlan. C4.5: program for classification learning. Morgan Kaufmann, 1992.
19. K. Wang, S. Zhou, and Y. He. Growing decision trees on support-less association rules. In KDD'00.
20. M. Zaki. Generating non-redundant association rules. In KDD'00.
21. M. Zaki and C.-J. Hsiao. Charm: An efficient algorithm for closed itemset mining. In SIAM'02.