Associative classification algorithms commonly have low efficiency and accuracy. A new associative classification algorithm by distilling effective rules
called ACDER
is presented. Both the remaining support and remaining confidence are defined. Then association classifier is constructed and pruned by distilling the most effective rules to ensure that there exists no any redundant and conflictive rules in the classifier. Experiment results on eight data sets show that the average accuracy of the classifier is 4.15% higher while the average number of rules in classifier is 54% lower than the CBA classification method.
关键词
Keywords
references
CHEN Yongqiang, HU Leifang. Study on data mining application in CRM system based on insurance trade[C]∥The 7th International Conference on Electronic Commerce. New York, USA: ACM, 2005: 839-841.
PEI Xiaomei, ZHENG Chongxun, XU Jin. Classifi-cation of motor imagery tasks with information accumulated technique[J]. Journal of Xi'an Jiaotong University, 2008,42(6):756-759.
HANA J W, NISHIOB S, KAWANOC H,et al. Generalization-based data mining in object-oriented databases using an object-cube model[J]. Data and Knowledge Engineering, 1998, 25(1/2): 55-97.
LI Wenmin, HAN Jiawei, PEI Jian. CMAR:accurate and efficient classification based on multiple class-association rules[C]∥The 2001 IEEE International Conference on Data Mining. Piscataway, NJ, USA: IEEE,2001: 369-376.
LIU Bing, HSU W, MA Yiming. Integrating classification and association rule mining [C]∥The 4th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York, USA:ACM, 1998: 80-86.
WANG Ke, ZHOU Senqiang, HE Yu. Growing decision tree on support-less association rules [C]∥The 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York, USA: ACM,2000: 265-269.
MURPHY-MERZ J C. UCI repository of machine learning databases[EB/OL].[2008-04-12]. http:∥www.ics.uci.edu/mlearn/_MLRepository.html.