COMPARATIVE ANALYSIS OF STROKE CLASSIFICATION USING THE K-NEAREST NEIGHBOR DECISION TREE, AND MULTILAYER PERCEPTRON METHODS

Ertina Sabarita Barus, Jenny Evans Halim, Sally Yessica
{"title":"COMPARATIVE ANALYSIS OF STROKE CLASSIFICATION USING THE K-NEAREST NEIGHBOR DECISION TREE, AND MULTILAYER PERCEPTRON METHODS","authors":"Ertina Sabarita Barus, Jenny Evans Halim, Sally Yessica","doi":"10.34012/jurnalsisteminformasidanilmukomputer.v7i1.4083","DOIUrl":null,"url":null,"abstract":"Stroke has become a serious health problem; the main cause of stroke is usually a blood clot in the arteries that supply blood to the brain. Strokes can also be caused by bleeding when blood vessels burst and blood leaks into the brain. In one year, about 12.2 million people will have their first stroke, and 6.5 million people will die from a stroke. More than 110 million people worldwide have had a stroke. Handling that is done quickly can minimize the level of brain damage and the potential adverse effects. Therefore, it is very important to predict whether a patient has the potential to experience a stroke. The K-Nearest Neighbor, Decision Tree, and Multilayer Perceptron algorithms are applied as a classification method to identify symptoms in patients and achieve an optimal accuracy level. The results of making the three algorithms are quite good, where K-Nearest Neighbor (K-NN) has an accuracy value of 93.84%, Decision Tree is 93.97%, and Multilayer Perceptron (MLP) is 93.91%. The best accuracy value is the Decision Tree algorithm with an accuracy difference of no more than 0.10% with the two algorithms used.","PeriodicalId":499639,"journal":{"name":"Jusikom : Jurnal Sistem Informasi Ilmu Komputer","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jusikom : Jurnal Sistem Informasi Ilmu Komputer","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34012/jurnalsisteminformasidanilmukomputer.v7i1.4083","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Stroke has become a serious health problem; the main cause of stroke is usually a blood clot in the arteries that supply blood to the brain. Strokes can also be caused by bleeding when blood vessels burst and blood leaks into the brain. In one year, about 12.2 million people will have their first stroke, and 6.5 million people will die from a stroke. More than 110 million people worldwide have had a stroke. Handling that is done quickly can minimize the level of brain damage and the potential adverse effects. Therefore, it is very important to predict whether a patient has the potential to experience a stroke. The K-Nearest Neighbor, Decision Tree, and Multilayer Perceptron algorithms are applied as a classification method to identify symptoms in patients and achieve an optimal accuracy level. The results of making the three algorithms are quite good, where K-Nearest Neighbor (K-NN) has an accuracy value of 93.84%, Decision Tree is 93.97%, and Multilayer Perceptron (MLP) is 93.91%. The best accuracy value is the Decision Tree algorithm with an accuracy difference of no more than 0.10% with the two algorithms used.
用k近邻决策树和多层感知器方法进行笔画分类的比较分析
中风已经成为一个严重的健康问题;中风的主要原因通常是向大脑供血的动脉中的血凝块。当血管破裂和血液渗入大脑时,出血也可能引起中风。在一年内,大约有1220万人将首次中风,650万人将死于中风。全世界有超过1.1亿人患过中风。快速处理可以将脑损伤程度和潜在的不利影响降到最低。因此,预测病人是否有中风的可能性是非常重要的。使用k近邻、决策树和多层感知器算法作为分类方法来识别患者的症状,并达到最佳的准确率水平。三种算法的制作结果都相当不错,其中k -最近邻(K-NN)的准确率值为93.84%,决策树(Decision Tree)的准确率值为93.97%,多层感知器(Multilayer Perceptron, MLP)的准确率值为93.91%。准确率最高的是决策树算法,与两种算法的准确率差不超过0.10%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信