.png){kind=icon}
返回
Using decision trees to summarize associative classification rules
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2007.12.031.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Association rule mining is one of the most popular issues within data mining. It discovers items that co-occur frequently within a set of transactions and determines rules based oil these co-occurrence relations. Classification problems have adopted association rules for years (associative classification). Once the rules have been generated, however, their lack of organization causes a readability problem, meaning it is difficult for users to analyze them and obtain a good understanding of the domain. Therefore, our work presents two algorithms that use decision trees to summarize associative classification rules. The obtained classification model combines the advantages of associative classification and decision trees. it organizes knowledge in it more readable, compact, well-organized form and is easier to use than associative classification. It also provides better classification accuracy than the traditional decision tree algorithm. (C) 2007 Elsevier Ltd. All rights reserved.
Keyword:
Decision trees
Rule-based classification
Rule summarization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
A geochemical study of the Ediacaran discoidal fossil Aspidella preserved in limestones: Implications for its taphonomy and paleoecology.png)
Geobiology
GeobiologyIF0
PREAI
分享收藏
Inherited arrhythmias and gene therapy: Are there any ethical considerations to take into account?
OAAI
OAAI分享收藏
查看更多内容