Penerapan algoritma K-Nearest Neighbors (KNN) untuk klasifikasi citra medis

This study aims to optimize the implementation of the K-Nearest Neighbors (K-NN) algorithm for medical image classification by focusing on selecting the optimal KKK parameter and applying dimensionality reduction techniques to improve accuracy and efficiency. The data used was sourced from public medical image repositories such as The Cancer Imaging Archive (TCIA) and Medical Image Analysis datasets, covering various diseases, including brain tumors, lung cancer, and kidney lesions. The research process involves data collection, data preprocessing, dimensionality reduction using Principal Component Analysis (PCA), applying the K-NN algorithm with Euclidean, Minkowski, and Cosine distance metrics, and performance evaluation using accuracy, precision, recall, and F1-score. Experimental results demonstrate that K=5with the Euclidean distance metric provides the best performance, achieving an accuracy of 90%. Additionally, PCA effectively reduces computational time by 30% without significantly compromising accuracy. This study proves that K-NN is an effective method for medical image classification. However, further research is needed to integrate K-NN with deep learning models to enhance performance and feature extraction capabilities.

Authors

Institutions

Publication Details

Journal
IT-Explore Jurnal Penerapan Teknologi Informasi dan Komunikasi
Published
2025-02-07
DOI
https://doi.org/10.24246/itexplore.v4i1.2025.pp33-43
Citations
1
Primary Topic
Data Mining and Machine Learning Applications
Type
article
Field-Weighted Citation Impact
3.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Penerapan algoritma K-Nearest Neighbors (KNN) untuk klasifikasi citra medis

Alanindra Saputra, Ilham Ramadhan, Gunawan, Nur Tulus Ujianto et al.
1 citations
IT-Explore Jurnal Penerapan Teknologi Informasi dan Komunikasi
Data Mining and Machine Learning Applications
3.25
article

Penerapan algoritma K-Nearest Neighbors (KNN) untuk klasifikasi citra medis

Alanindra Saputra, Ilham Ramadhan, Gunawan, Nur Tulus Ujianto, Azizah Permata Fanti, Haris Fadillah
article en
1 citations

Abstract

This study aims to optimize the implementation of the K-Nearest Neighbors (K-NN) algorithm for medical image classification by focusing on selecting the optimal KKK parameter and applying dimensionality reduction techniques to improve accuracy and efficiency. The data used was sourced from public medical image repositories such as The Cancer Imaging Archive (TCIA) and Medical Image Analysis datasets, covering various diseases, including brain tumors, lung cancer, and kidney lesions. The research process involves data collection, data preprocessing, dimensionality reduction using Principal Component Analysis (PCA), applying the K-NN algorithm with Euclidean, Minkowski, and Cosine distance metrics, and performance evaluation using accuracy, precision, recall, and F1-score. Experimental results demonstrate that K=5with the Euclidean distance metric provides the best performance, achieving an accuracy of 90%. Additionally, PCA effectively reduces computational time by 30% without significantly compromising accuracy. This study proves that K-NN is an effective method for medical image classification. However, further research is needed to integrate K-NN with deep learning models to enhance performance and feature extraction capabilities.

IT-Explore Jurnal Penerapan Teknologi Informasi dan KomunikasiVol. 4(1)
Universitas Pancasakti Tegal (ID)
Openalex Percentile: Top 9%
Data Mining and Machine Learning Applications
3.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.