Essential classification rule sets

被引:20
作者
Baralis, E [1 ]
Chiusano, S [1 ]
机构
[1] Politecn Torino, Dipartimento Automat & Informat, I-10129 Turin, Italy
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 2004年 / 29卷 / 04期
关键词
association rules; associative classification; concise representations; algorithms; experimentation; theory;
D O I
10.1145/1042046.1042048
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Given a class model built from a dataset including labeled data, classification assigns a new data object to the appropriate class. In associative classification the class model (i.e., the classifier) is a set of association rules. Associative classification is a promising technique for the generation of highly accurate classifiers. In this article, we present a compact form which encodes without information loss the classification knowledge available in a classification rule set. This form includes the rules that are essential for classification purposes, and thus it can replace the complete rule set. The proposed form is particularly effective in dense datasets, where traditional extraction techniques may generate huge rule sets. The reduction in size of the rule set allows decreasing the complexity of both the rule generation step and the rule pruning step. Hence, classification rule extraction can be performed also with low support, in order to extract more, possibly useful. rules.
引用
收藏
页码:635 / 674
页数:40
相关论文
共 50 条
[1]   A tree projection algorithm for generation of frequent item sets [J].
Agarwal, RC ;
Aggarwal, CC ;
Prasad, VVV .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2001, 61 (03) :350-371
[2]   DATABASE MINING - A PERFORMANCE PERSPECTIVE [J].
AGRAWAL, R ;
IMIELINSKI, T ;
SWAMI, A .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1993, 5 (06) :914-925
[3]  
Agrawal R, 1994, P 20 INT C VER LARG, V1215, P487
[4]  
[Anonymous], P 1996 ACM SIGMOD IN
[5]  
[Anonymous], P 1998 ACM SIGMOD IN
[6]  
[Anonymous], 1993, P 13 INT JOINT C ART
[7]  
[Anonymous], P ES 02
[8]   A lazy approach to pruning classification rules [J].
Baralis, E ;
Garza, P .
2002 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2002, :35-42
[9]  
BARALIS E, 2002, P IEEE ICDM WORKSH F, P143
[10]  
Bastide I, 2000, LECT NOTES ARTIF INT, V1861, P972