GARC: A New Associative Classification Approach

Many studies in data mining have proposed a new classification approach called associative classification. According to several reports associative classification achieves higher classification accuracy than do traditional classification approaches. However, the associative classification suffers from a major drawback: it is based on the use of a very large number of classification rules; and consequently takes efforts to select the best ones in order to construct the classifier. To overcome such drawback, we propose a new associative classification method called Garc that exploits a generic basis of association rules in order to reduce the number of association rules without jeopardizing the classification accuracy. Moreover, Garc proposes a new selection criterion called score, allowing to ameliorate the selection of the best rules during classification. Carried out experiments on 12 benchmark data sets indicate that Garc is highly competitive in terms of accuracy in comparison with popular associative classification methods.

[1]  Gerd Stumme,et al.  Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets , 2000, Computational Logic.

[2]  L. Beran,et al.  [Formal concept analysis]. , 1996, Casopis lekaru ceskych.

[3]  Osmar R. Zaïane,et al.  Text document categorization by term association , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[4]  Jiawei Han,et al.  CPAR: Classification based on Predictive Association Rules , 2003, SDM.

[5]  Sadok Ben Yahia,et al.  Prince: An Algorithm for Generating Rule Bases Without Closure Computations , 2005, DaWaK.

[6]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[7]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[8]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[9]  Nicolas Pasquier,et al.  Efficient Mining of Association Rules Using Closed Itemset Lattices , 1999, Inf. Syst..

[10]  Jian Pei,et al.  CMAR: accurate and efficient classification based on multiple class-association rules , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[11]  Jianyong Wang,et al.  HARMONY: Efficiently Mining the Best Rules for Classification , 2005, SDM.

[12]  Engelbert Mephu Nguifo,et al.  A new Informative Generic Base of Association Rules , 2005, CLA.

[13]  Marzena Kryszkiewicz,et al.  Representative Association Rules and Minimum Condition Maximum Consequence Association Rules , 1998, PKDD.

[14]  Osmar R. Zaïane,et al.  Classifying Text Documents by Associating Terms With Text Categories , 2002, Australasian Database Conference.

[15]  Marzena Kryszkiewicz Concise Representations of Association Rules , 2002, Pattern Detection and Discovery.

[16]  Osmar R. Zaïane,et al.  On Pruning and Tuning Rules for Associative Classifiers , 2005, KES.

[17]  R. Mike Cameron-Jones,et al.  FOIL: A Midterm Report , 1993, ECML.

[18]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[19]  Wynne Hsu,et al.  Integrating Classification and Association Rule Mining , 1998, KDD.