An approach for adaptive associative classification

As a branch of classification, associative classification combines the basic ideas of association rule mining and general classification. Previous studies show that associative classification can achieve a higher classification accuracy comparing with traditional classification methods, such as C4.5. It is known that new frequent patterns may emerge from the classified resources during classification, and these newly emerging frequent patterns can be used to build new classification rules. However, this dynamic characteristics in associative classification has not been well reflected in traditional methods. In this paper, we propose an enhanced associative classification method by integrating the dynamic property in the process of associative classification. In the proposed method, we employ co-training to refine the discovered emerging frequent patterns for classification rule extension and utilize the maximum entropy model for class label prediction. The empirical study shows that our method can be used to classify increasing resources efficiently and effectively.

[1]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD 2000.

[2]  Philip S. Yu,et al.  Moment: maintaining closed frequent itemsets over a stream sliding window , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).

[3]  Ian H. Witten,et al.  The WEKA data mining software: an update , 2009, SKDD.

[4]  Jiawei Han,et al.  Discriminative Frequent Pattern Analysis for Effective Classification , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

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

[6]  Young-Koo Lee,et al.  Efficient frequent pattern mining over data streams , 2008, CIKM '08.

[7]  Rayid Ghani,et al.  Analyzing the effectiveness and applicability of co-training , 2000, CIKM '00.

[8]  David G. Stork,et al.  Pattern Classification , 1973 .

[9]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

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

[11]  Fadi A. Thabtah,et al.  A review of associative classification mining , 2007, The Knowledge Engineering Review.

[12]  Jian Pei,et al.  CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.

[13]  Philip S. Yu,et al.  Direct mining of discriminative and essential frequent patterns via model-based search tree , 2008, KDD.

[14]  Adam L. Berger,et al.  A Maximum Entropy Approach to Natural Language Processing , 1996, CL.

[15]  Davy Janssens,et al.  Improving associative classification by incorporating novel interestingness measures , 2005, IEEE International Conference on e-Business Engineering (ICEBE'05).

[16]  Jiawei Han,et al.  Generating semantic annotations for frequent patterns with context analysis , 2006, KDD '06.

[17]  Mohammed J. Zaki,et al.  Lazy Associative Classification , 2006, Sixth International Conference on Data Mining (ICDM'06).

[18]  Jinyan Li,et al.  CAEP: Classification by Aggregating Emerging Patterns , 1999, Discovery Science.

[19]  Thorsten Joachims,et al.  Transductive Inference for Text Classification using Support Vector Machines , 1999, ICML.

[20]  Peter I. Cowling,et al.  Improving rule sorting, predictive accuracy and training time in associative classification , 2006, Expert Syst. Appl..

[21]  Peter I. Cowling,et al.  MMAC: a new multi-class, multi-label associative classification approach , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).

[22]  Jiawei Han,et al.  Summarizing itemset patterns: a profile-based approach , 2005, KDD '05.

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

[24]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

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

[26]  Kotagiri Ramamohanarao,et al.  Fast discovery and the generalization of strong jumping emerging patterns for building compact and accurate classifiers , 2006, IEEE Transactions on Knowledge and Data Engineering.

[27]  George Karypis,et al.  Frequent substructure-based approaches for classifying chemical compounds , 2003, IEEE Transactions on Knowledge and Data Engineering.

[28]  Anthony K. H. Tung,et al.  Mining top-K covering rule groups for gene expression data , 2005, SIGMOD '05.

[29]  Yuan-Chun Jiang,et al.  Integrating classification capability and reliability in associative classification: A beta-stronger model , 2010, Expert Syst. Appl..

[30]  Nicolas Pasquier,et al.  Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.

[31]  Chih-Jen Lin,et al.  LIBSVM: A library for support vector machines , 2011, TIST.

[32]  Sumeet Dua,et al.  Associative classification of mammograms using weighted rules , 2009, Expert Syst. Appl..

[33]  Yen-Liang Chen,et al.  Using decision trees to summarize associative classification rules , 2009, Expert Syst. Appl..

[34]  Susan T. Dumais Personal Information Management: Stuff I've Seen and Beyond , 2004, ADCS.

[35]  Peter I. Cowling,et al.  A greedy classification algorithm based on association rule , 2007, Appl. Soft Comput..

[36]  Avrim Blum,et al.  The Bottleneck , 2021, Monopsony Capitalism.

[37]  Jigui Sun,et al.  Post-processing of associative classification rules using closed sets , 2009, Expert Syst. Appl..