基于特征分析的心脏疾病最优诊断混合机器学习算法

G. Ahmad, H. Fatima, Shafiullah, M. Haris
{"title":"基于特征分析的心脏疾病最优诊断混合机器学习算法","authors":"G. Ahmad, H. Fatima, Shafiullah, M. Haris","doi":"10.1109/PIECON56912.2023.10085781","DOIUrl":null,"url":null,"abstract":"Timely prediction of heart disease and its cause is the most challenging issue in medical science. This paper uses various machine learning algorithms such as Logistic Regression, Support Vector Machine, Decision Tree, Random Forest, Naive Bayes, K-Nearest Neighbourhood, and K-fold cross-validation are used to predict heart diseases. The system uses a K-fold cross-validation technique to enhance the accuracies of algorithms. The UCI Kaggle Cleveland heart disease datasets is used to analyse the performance of the models. It is found in the experiment that the training accuracy of K-Nearest Neighbour is 88.52%, and Recall is 93.30%. The Random Forest produced the highest and most comparable Receiver Operating Characteristics Curve accuracy. Moreover, the experimental results of the recommended techniques are compared with previous heart disease prediction studies, and it is found that among the suggested technique, the performance of K-Nearest Neighbour is best. The fundamental goal of this study is to design a novel and distinctive model-creation approach for resolving practical issues.","PeriodicalId":182428,"journal":{"name":"2023 International Conference on Power, Instrumentation, Energy and Control (PIECON)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hybrid Machine Learning Algorithms for Optimal Diagnosis of Heart Disease with Feature Analysis\",\"authors\":\"G. Ahmad, H. Fatima, Shafiullah, M. Haris\",\"doi\":\"10.1109/PIECON56912.2023.10085781\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Timely prediction of heart disease and its cause is the most challenging issue in medical science. This paper uses various machine learning algorithms such as Logistic Regression, Support Vector Machine, Decision Tree, Random Forest, Naive Bayes, K-Nearest Neighbourhood, and K-fold cross-validation are used to predict heart diseases. The system uses a K-fold cross-validation technique to enhance the accuracies of algorithms. The UCI Kaggle Cleveland heart disease datasets is used to analyse the performance of the models. It is found in the experiment that the training accuracy of K-Nearest Neighbour is 88.52%, and Recall is 93.30%. The Random Forest produced the highest and most comparable Receiver Operating Characteristics Curve accuracy. Moreover, the experimental results of the recommended techniques are compared with previous heart disease prediction studies, and it is found that among the suggested technique, the performance of K-Nearest Neighbour is best. The fundamental goal of this study is to design a novel and distinctive model-creation approach for resolving practical issues.\",\"PeriodicalId\":182428,\"journal\":{\"name\":\"2023 International Conference on Power, Instrumentation, Energy and Control (PIECON)\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 International Conference on Power, Instrumentation, Energy and Control (PIECON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIECON56912.2023.10085781\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Power, Instrumentation, Energy and Control (PIECON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIECON56912.2023.10085781","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

及时预测心脏病及其病因是医学上最具挑战性的问题。本文使用各种机器学习算法,如逻辑回归、支持向量机、决策树、随机森林、朴素贝叶斯、k近邻和k折交叉验证等来预测心脏病。该系统使用K-fold交叉验证技术来提高算法的准确性。UCI Kaggle Cleveland心脏病数据集用于分析模型的性能。实验发现,K-Nearest Neighbour的训练准确率为88.52%,Recall为93.30%。随机森林产生了最高和最可比的接收者操作特性曲线精度。此外,将推荐技术的实验结果与以往的心脏病预测研究进行了比较,发现在推荐的技术中,k近邻的性能最好。本研究的基本目标是设计一种新颖而独特的模型创建方法来解决实际问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hybrid Machine Learning Algorithms for Optimal Diagnosis of Heart Disease with Feature Analysis
Timely prediction of heart disease and its cause is the most challenging issue in medical science. This paper uses various machine learning algorithms such as Logistic Regression, Support Vector Machine, Decision Tree, Random Forest, Naive Bayes, K-Nearest Neighbourhood, and K-fold cross-validation are used to predict heart diseases. The system uses a K-fold cross-validation technique to enhance the accuracies of algorithms. The UCI Kaggle Cleveland heart disease datasets is used to analyse the performance of the models. It is found in the experiment that the training accuracy of K-Nearest Neighbour is 88.52%, and Recall is 93.30%. The Random Forest produced the highest and most comparable Receiver Operating Characteristics Curve accuracy. Moreover, the experimental results of the recommended techniques are compared with previous heart disease prediction studies, and it is found that among the suggested technique, the performance of K-Nearest Neighbour is best. The fundamental goal of this study is to design a novel and distinctive model-creation approach for resolving practical issues.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信