The Community for Technology Leaders
2013 IEEE 13th International Conference on Data Mining (2001)
San Jose, California
Nov. 29, 2001 to Dec. 2, 2001
ISBN: 0-7695-1119-8
pp: 369
Previous studies propose that associative classification has high classification accuracy and strong flexibility at handling unstructured data. However, it still suffers from the huge set of mined rules and sometimes biased classification or overfitting since the classification is based on only single high-confidence rule. In this study, we propose new associative classification method, CMAR, i.e., Classification based on Multiple Association Rules. The method extends an efficient frequent pattern mining method, FP-growth ,constructs classdistribution-associated FP-tree, and mines large database efficiently. Moreover, it applies CR-tree structure to store and retrieve mined association rules efficiently, and prunes rules effectively based on confidence, correlation and database coverage. The classification is performed based on weighted X<sup>2</sup> analysis using multiple strong association rules. Our extensive experiments on 26 databases from UCI machine learning database repository show that CMAR is consistent, highly effective at classification of various kinds of databases and has better average classification accuracy in comparison with CBA and C4.5.Moreover,our performance study shows that the method is highly efficient and scalable in comparison with other reported associative classification methods.
Jian Pei, Jiawei Han, Wenmin Li, "CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules", 2013 IEEE 13th International Conference on Data Mining, vol. 00, no. , pp. 369, 2001, doi:10.1109/ICDM.2001.989541
106 ms
(Ver 3.3 (11022016))