An Improved ID3 Classification Algorithm Based On Correlation Function and Weighted Attribute*

Fatima Es-Sabery, Abdellatif Hair
{"title":"An Improved ID3 Classification Algorithm Based On Correlation Function and Weighted Attribute*","authors":"Fatima Es-Sabery, Abdellatif Hair","doi":"10.1109/ISACS48493.2019.9068891","DOIUrl":null,"url":null,"abstract":"ID3 decision tree algorithm is a supervised learning model based on calculating the information gain to select the best splitting attribute, which is the main factor to construct a decision tree. The process of calculating gain takes into consideration only a current condition attribute and decision attribute, and the other condition attributes cannot be used to measure the attribute importance. Because of the above problem, an improved ID3 takes into consideration the connection between the current condition attribute and the other conditions attributes. An experiment is presented to compare our improved algorithm with the traditional ID3 algorithm. Experiment results show that our improved algorithm provides a decision tree with less number of leaves and higher predictive accuracy.","PeriodicalId":312521,"journal":{"name":"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISACS48493.2019.9068891","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

ID3 decision tree algorithm is a supervised learning model based on calculating the information gain to select the best splitting attribute, which is the main factor to construct a decision tree. The process of calculating gain takes into consideration only a current condition attribute and decision attribute, and the other condition attributes cannot be used to measure the attribute importance. Because of the above problem, an improved ID3 takes into consideration the connection between the current condition attribute and the other conditions attributes. An experiment is presented to compare our improved algorithm with the traditional ID3 algorithm. Experiment results show that our improved algorithm provides a decision tree with less number of leaves and higher predictive accuracy.
一种基于关联函数和加权属性的改进ID3分类算法
ID3决策树算法是一种基于计算信息增益来选择最佳分割属性的监督学习模型,分割属性是构造决策树的主要因素。计算增益的过程只考虑当前条件属性和决策属性,其他条件属性不能用来衡量属性的重要性。由于上述问题,改进的ID3考虑了当前条件属性与其他条件属性之间的连接。通过实验将改进算法与传统的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学术官方微信