重点研究基于树算法和特征选择的心脏病占卜

ParizatBinta Kabir, Sharmin Akter
{"title":"重点研究基于树算法和特征选择的心脏病占卜","authors":"ParizatBinta Kabir, Sharmin Akter","doi":"10.1109/ICSES52305.2021.9633870","DOIUrl":null,"url":null,"abstract":"Heart disease has evolved to become the most deadly ailment on the earth, and it has been the top reason for mortality worldwide. As a result, a dependable, efficient, and practical method for diagnosing and treating such disorders promptly is required. This study examines and compares several Machine Learning (ML) algorithms and approaches. Six ML classifiers are tested to see which one's the most successful at diagnosing heart disease. Tree-based techniques are among the most basic and extensively used ensemble learning approaches. According to the analysis, tree-based models such as Decision Tree (DT) and Random Forest (RF) deliver actionable insights with high efficacy, uniformity, and applicability. Relevant features are identified by using the Feature Selection (FS) process, and the output of classifiers is calculated based on these features. FS removes irrelevant features without impacting learning output. Our research intends to improve the system's efficiency. The goal of this research is to combine FS with tree-based algorithms to improve the accuracy of heart disease prediction.","PeriodicalId":6777,"journal":{"name":"2021 International Conference on Innovative Computing, Intelligent Communication and Smart Electrical Systems (ICSES)","volume":"210 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Emphasised Research on Heart Disease Divination Applying Tree Based Algorithms and Feature Selection\",\"authors\":\"ParizatBinta Kabir, Sharmin Akter\",\"doi\":\"10.1109/ICSES52305.2021.9633870\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Heart disease has evolved to become the most deadly ailment on the earth, and it has been the top reason for mortality worldwide. As a result, a dependable, efficient, and practical method for diagnosing and treating such disorders promptly is required. This study examines and compares several Machine Learning (ML) algorithms and approaches. Six ML classifiers are tested to see which one's the most successful at diagnosing heart disease. Tree-based techniques are among the most basic and extensively used ensemble learning approaches. According to the analysis, tree-based models such as Decision Tree (DT) and Random Forest (RF) deliver actionable insights with high efficacy, uniformity, and applicability. Relevant features are identified by using the Feature Selection (FS) process, and the output of classifiers is calculated based on these features. FS removes irrelevant features without impacting learning output. Our research intends to improve the system's efficiency. The goal of this research is to combine FS with tree-based algorithms to improve the accuracy of heart disease prediction.\",\"PeriodicalId\":6777,\"journal\":{\"name\":\"2021 International Conference on Innovative Computing, Intelligent Communication and Smart Electrical Systems (ICSES)\",\"volume\":\"210 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Innovative Computing, Intelligent Communication and Smart Electrical Systems (ICSES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSES52305.2021.9633870\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Innovative Computing, Intelligent Communication and Smart Electrical Systems (ICSES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSES52305.2021.9633870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

心脏病已经发展成为地球上最致命的疾病,也是全世界死亡的头号原因。因此,需要一种可靠、有效和实用的方法来及时诊断和治疗这些疾病。本研究考察并比较了几种机器学习(ML)算法和方法。测试了六个ML分类器,看看哪一个在诊断心脏病方面最成功。基于树的技术是最基本和最广泛使用的集成学习方法之一。根据分析,基于树的模型,如决策树(DT)和随机森林(RF)提供了具有高效率、一致性和适用性的可操作的见解。使用特征选择(FS)过程识别相关特征,并根据这些特征计算分类器的输出。FS在不影响学习输出的情况下删除不相关的特征。我们的研究旨在提高系统的效率。本研究的目标是将FS与基于树的算法相结合,以提高心脏病预测的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Emphasised Research on Heart Disease Divination Applying Tree Based Algorithms and Feature Selection
Heart disease has evolved to become the most deadly ailment on the earth, and it has been the top reason for mortality worldwide. As a result, a dependable, efficient, and practical method for diagnosing and treating such disorders promptly is required. This study examines and compares several Machine Learning (ML) algorithms and approaches. Six ML classifiers are tested to see which one's the most successful at diagnosing heart disease. Tree-based techniques are among the most basic and extensively used ensemble learning approaches. According to the analysis, tree-based models such as Decision Tree (DT) and Random Forest (RF) deliver actionable insights with high efficacy, uniformity, and applicability. Relevant features are identified by using the Feature Selection (FS) process, and the output of classifiers is calculated based on these features. FS removes irrelevant features without impacting learning output. Our research intends to improve the system's efficiency. The goal of this research is to combine FS with tree-based algorithms to improve the accuracy of heart disease prediction.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信