Data Mining berbasis Nearest Neighbor dan Seleksi Fitur untuk Deteksi Kanker Payudara

Yohanes Setiawan
{"title":"Data Mining berbasis Nearest Neighbor dan Seleksi Fitur untuk Deteksi Kanker Payudara","authors":"Yohanes Setiawan","doi":"10.30591/jpit.v8i2.4994","DOIUrl":null,"url":null,"abstract":"Detecting breast cancer in early stage is not straightforward. This happens because biopsy test requires time to determine whether the type is benign or malignant. Data mining algorithm has been widely used to automate diagnosis of a disease. One of popular algorithms is nearest neighbor based because of its simplicity and low computation. However, too many features can cause low accuracy in nearest neighbor based models. In this research, nearest neighbor based with feature selection is developed to detect breast cancer. Conventional k-Nearest Neighbor (KNN) and Multi Local Means k-Harmonic Nearest Neighbor have been chosen as nearest neighbor based models to experiment. The feature selection method used in this study is filter based, namely Correlation based, Information Gain, and ReliefF. The experimental result shows that the highest recall metric of MLM-KHNN and Information Gain is 94% with 5 features. In brief, MLM-KHNN algorithm with Information Gain can increase the recall of the prediction of breast cancer compared with the conventional K-NN algorithm and have been deployed into website using Streamlit such that the model can be used to detect breast cancer from chosen Wisconsin dataset features.","PeriodicalId":53375,"journal":{"name":"Jurnal Informatika Jurnal Pengembangan IT","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Informatika Jurnal Pengembangan IT","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30591/jpit.v8i2.4994","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Detecting breast cancer in early stage is not straightforward. This happens because biopsy test requires time to determine whether the type is benign or malignant. Data mining algorithm has been widely used to automate diagnosis of a disease. One of popular algorithms is nearest neighbor based because of its simplicity and low computation. However, too many features can cause low accuracy in nearest neighbor based models. In this research, nearest neighbor based with feature selection is developed to detect breast cancer. Conventional k-Nearest Neighbor (KNN) and Multi Local Means k-Harmonic Nearest Neighbor have been chosen as nearest neighbor based models to experiment. The feature selection method used in this study is filter based, namely Correlation based, Information Gain, and ReliefF. The experimental result shows that the highest recall metric of MLM-KHNN and Information Gain is 94% with 5 features. In brief, MLM-KHNN algorithm with Information Gain can increase the recall of the prediction of breast cancer compared with the conventional K-NN algorithm and have been deployed into website using Streamlit such that the model can be used to detect breast cancer from chosen Wisconsin dataset features.
基于Nearest的环境数据挖掘和为乳腺癌检测提供的特性选择
早期发现乳腺癌并不容易。这是因为活组织检查需要时间来确定是良性还是恶性。数据挖掘算法已被广泛应用于疾病的自动诊断。基于最近邻的算法以其简单、计算量小而广受欢迎。然而,太多的特征会导致基于最近邻的模型精度低。本研究提出了基于最近邻特征选择的乳腺癌检测方法。选择传统的k-近邻(KNN)和多局部均值k-谐波近邻作为最近邻模型进行实验。本研究中使用的特征选择方法是基于滤波器的,即Correlation based、Information Gain和ReliefF。实验结果表明,具有5个特征的传销- khnn和信息增益的召回率最高为94%。简而言之,与传统的K-NN算法相比,具有信息增益的MLM-KHNN算法可以提高乳腺癌预测的召回率,并且已经使用Streamlit部署到网站中,这样该模型可以用于从选定的威斯康星州数据集特征中检测乳腺癌。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
审稿时长
24 weeks
×
引用
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学术官方微信