Quantum-Enhanced K-Medoids Clustering: Comparative Analysis of Stroke Medical Data

Stroke is a severe medical condition that occurs when the blood supply to parts of the brain is interrupted or reduced, resulting in brain tissue that lacks oxygen and nutrients. This causes brain cells to start to die in minutes. Early prevention reduces the risk of stroke. In this study, a quantum computing approach is used to improve the performance of the K-Medoids method. A comparative analysis of these methods was carried out with a focus on their performance, especially on the accuracy of the test results. The investigation was carried out using a data set of stroke patient medical records. The data set was tested using the classical and K-Medoids methods with a quantum computing approach utilizing Manhattan distance calculations. The findings of this research reveal improvements in the K-Medoids algorithm with Manhattan distance calculation influenced by the integration of a quantum computing framework. In particular, the simulation test results show an increase in accuracy from the classical K-Medoids method to the K-Medoids method with a quantum computing approach, from 52% to 64%. These results highlight that the performance of the K-Medoids method with a quantum computing approach is superior to that of the classical K-Medoids method.

Authors

Institutions

Publication Details

Journal
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)
Published
2024-10-07
DOI
https://doi.org/10.29207/resti.v8i5.5814
Primary Topic
Neurological Disorders and Treatments
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum-Enhanced K-Medoids Clustering: Comparative Analysis of Stroke Medical Data

Marvin Frans Sakti Hutabarat, R. Fanry Siahaan, Jeremia Siregar, Swingly Purba et al.
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)
Neurological Disorders and Treatments
article

Quantum-Enhanced K-Medoids Clustering: Comparative Analysis of Stroke Medical Data

Marvin Frans Sakti Hutabarat, R. Fanry Siahaan, Jeremia Siregar, Swingly Purba, Rasmi Sitohang
article en

Abstract

Stroke is a severe medical condition that occurs when the blood supply to parts of the brain is interrupted or reduced, resulting in brain tissue that lacks oxygen and nutrients. This causes brain cells to start to die in minutes. Early prevention reduces the risk of stroke. In this study, a quantum computing approach is used to improve the performance of the K-Medoids method. A comparative analysis of these methods was carried out with a focus on their performance, especially on the accuracy of the test results. The investigation was carried out using a data set of stroke patient medical records. The data set was tested using the classical and K-Medoids methods with a quantum computing approach utilizing Manhattan distance calculations. The findings of this research reveal improvements in the K-Medoids algorithm with Manhattan distance calculation influenced by the integration of a quantum computing framework. In particular, the simulation test results show an increase in accuracy from the classical K-Medoids method to the K-Medoids method with a quantum computing approach, from 52% to 64%. These results highlight that the performance of the K-Medoids method with a quantum computing approach is superior to that of the classical K-Medoids method.

Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)Vol. 8(5)
Institut Sains dan Teknologi TD Pardede (ID)
Good health and well-being
Openalex Percentile: Top 70%
Neurological Disorders and Treatments
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.