Performance Evaluation of Entorpy and Gini Using Threaded and Non-threaded ID3 on Anaemia Dataset

C. Kishore, K. P. Rao, G. S. Murthy
{"title":"Performance Evaluation of Entorpy and Gini Using Threaded and Non-threaded ID3 on Anaemia Dataset","authors":"C. Kishore, K. P. Rao, G. S. Murthy","doi":"10.1109/CSNT.2015.112","DOIUrl":null,"url":null,"abstract":"Classification is an important data mining task, and decision trees have emerged as a popular classifier due to their simplicity and relatively low computational complexity. Time required to build a decision tree becomes intractable, as datasets get extremely large. To overcome this problem we proposed a parallel mode of ID3 algorithm. Decision tree building is well-suited for thread-level parallelism as it requires a large number of independent computations. In this paper, we present the analysis and parallel implementation of the ID3 algorithm using Entropy and Gini as heuristics, along with experimental results conducted on the anaemic patient's data set.","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Fifth International Conference on Communication Systems and Network Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSNT.2015.112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Classification is an important data mining task, and decision trees have emerged as a popular classifier due to their simplicity and relatively low computational complexity. Time required to build a decision tree becomes intractable, as datasets get extremely large. To overcome this problem we proposed a parallel mode of ID3 algorithm. Decision tree building is well-suited for thread-level parallelism as it requires a large number of independent computations. In this paper, we present the analysis and parallel implementation of the ID3 algorithm using Entropy and Gini as heuristics, along with experimental results conducted on the anaemic patient's data set.
在贫血数据集上使用线程和非线程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学术官方微信