A framework for integrating a decision tree learning algorithm and cluster analysis

M. Kurematsu, H. Fujita
{"title":"A framework for integrating a decision tree learning algorithm and cluster analysis","authors":"M. Kurematsu, H. Fujita","doi":"10.1109/SoMeT.2013.6645670","DOIUrl":null,"url":null,"abstract":"We proposed a modified decision tree learning algorithm to improve this algorithm in this paper. Our proposed approach classifies given data set by a traditional decision tree learning algorithm and cluster analysis and selects whichever is better according to information gain. In order to evaluate our approach, we did an experiment using program-generated data sets. We compared ID3 which is one of well-known decision tree learning algorithm to our approach about the recall ratio in this experiment. Experimental result shows the recall ratio of our approach is similar than the recall ratio of a traditional decision tree learning algorithm. Though we can not show the advantage of our approach according to the experiment, we show it is worth using cluster analysis to make a decision tree. In future, we have to evaluate our approach according to cross-validation method using big and complex data sets in order to say the advantage of our approach. We think our approach is not good for all data set, so we try to find the situation which our approach is better than other approaches according to the experimental results. In addition to, we have to show how to explain a decision tree by our approach to keep the readability of a decision tree.","PeriodicalId":447065,"journal":{"name":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SoMeT.2013.6645670","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

We proposed a modified decision tree learning algorithm to improve this algorithm in this paper. Our proposed approach classifies given data set by a traditional decision tree learning algorithm and cluster analysis and selects whichever is better according to information gain. In order to evaluate our approach, we did an experiment using program-generated data sets. We compared ID3 which is one of well-known decision tree learning algorithm to our approach about the recall ratio in this experiment. Experimental result shows the recall ratio of our approach is similar than the recall ratio of a traditional decision tree learning algorithm. Though we can not show the advantage of our approach according to the experiment, we show it is worth using cluster analysis to make a decision tree. In future, we have to evaluate our approach according to cross-validation method using big and complex data sets in order to say the advantage of our approach. We think our approach is not good for all data set, so we try to find the situation which our approach is better than other approaches according to the experimental results. In addition to, we have to show how to explain a decision tree by our approach to keep the readability of a decision tree.
一个整合决策树学习算法和聚类分析的框架
本文提出了一种改进的决策树学习算法来改进该算法。该方法通过传统的决策树学习算法和聚类分析对给定的数据集进行分类,并根据信息增益选择较好的数据集。为了评估我们的方法,我们使用程序生成的数据集做了一个实验。在本实验中,我们将著名的决策树学习算法ID3与我们的召回率方法进行了比较。实验结果表明,该方法的召回率与传统决策树学习算法的召回率相近。虽然我们不能通过实验证明我们的方法的优势,但我们证明了用聚类分析来制作决策树是值得的。未来,我们必须根据使用大型复杂数据集的交叉验证方法来评估我们的方法,以说明我们的方法的优势。我们认为我们的方法并不适用于所有的数据集,所以我们尝试根据实验结果找到我们的方法比其他方法更好的情况。此外,我们必须展示如何通过我们的方法来解释决策树,以保持决策树的可读性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信