CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules

ICDM(2001)

引用 1917|浏览499
暂无评分
摘要
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 classificationis 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 rulesefficiently, and prunes rules effectively based on confidence, correlation and database coverage. The classification is performed based on weighted X2 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 classificationof various kinds of databases and has better average classificationaccuracy in comparison with CBA and C4.5.Moreover,our performancestudy shows that the method is highly efficient and scalable in comparison with other reported associative classification methods.
更多
查看译文
关键词
associative classification,mines large database,mined rule,efficient frequent pattern mining,new associative classification method,mined association rulesefficiently,database coverage,efficient classification,multiple class-association rules,associative classification method,database repository show,high classification accuracy,learning artificial intelligence,tree structure,association rules,training data,data mining,machine learning,predictive models,tree data structures,information retrieval,overfitting,databases,association rule
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要