How to Compare and Interpret Two Learnt Decision Trees from the Same Domain?

P. Perner
{"title":"How to Compare and Interpret Two Learnt Decision Trees from the Same Domain?","authors":"P. Perner","doi":"10.1109/WAINA.2013.201","DOIUrl":null,"url":null,"abstract":"Data mining methods are widely used across many disciplines to identify patterns, rules or associations among huge volumes of data. Decision tree induction such as C4.5 is the most preferred method for classification since it works well on average regardless of the data set being used. The resulting decision tree has explanation capability but problems arise if the data set has been collected at different times or is enlarging and the decision tree induction process has been repeated. The resulting tree will change and the expert is questioning the trustworthy of the result. That brings us to the problem of comparing two decision trees in accordance with its explanation power. In this paper, we present a method how to compare two decision trees and how to interpret the change of the structure and the attributes in the decision tree.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WAINA.2013.201","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Data mining methods are widely used across many disciplines to identify patterns, rules or associations among huge volumes of data. Decision tree induction such as C4.5 is the most preferred method for classification since it works well on average regardless of the data set being used. The resulting decision tree has explanation capability but problems arise if the data set has been collected at different times or is enlarging and the decision tree induction process has been repeated. The resulting tree will change and the expert is questioning the trustworthy of the result. That brings us to the problem of comparing two decision trees in accordance with its explanation power. In this paper, we present a method how to compare two decision trees and how to interpret the change of the structure and the attributes in the decision tree.
如何比较和解释来自同一领域的两种学习决策树?
数据挖掘方法广泛应用于许多学科,用于识别大量数据中的模式、规则或关联。决策树归纳(如C4.5)是最受欢迎的分类方法,因为无论使用的数据集如何,它的平均效果都很好。所得到的决策树具有解释能力,但如果数据集是在不同时间收集的,或者正在扩大,并且重复决策树归纳过程,则会出现问题。结果树会改变,专家会质疑结果的可信度。这就给我们带来了根据解释能力比较两棵决策树的问题。本文提出了一种比较两棵决策树的方法,以及如何解释决策树结构和属性的变化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信