Optimizing K-Nearest Neighbor Values Using The Elbow Method

Optimizing the K value in the K-Nearest Neighbor (KNN) algorithm is a critical step in enhancing model performance, particularly for tasks related to classification and prediction. The Elbow method has emerged as a widely used technique for determining the optimal K value by analyzing the point where adding more neighbors does not significantly reduce error or improve model performance. This study focuses on the application of the Elbow method for optimizing the K value in the context of classifying BRIMo application reviews on the Google Play platform. By conducting a comparative analysis between the K value determined by the Elbow method and the traditionally chosen K value in KNN, this research demonstrates the advantages of using the Elbow method for improving classification accuracy. The experimental results reveal that the K value derived from the Elbow method (0.8) outperforms the traditional K value (0.78), resulting in a notable improvement in model performance. This superior accuracy highlights the effectiveness of the Elbow method in selecting a more optimal K value, leading to a better fit for the data and more precise predictions. Consequently, the use of the Elbow method for optimizing the K value in the KNN algorithm proves to be a highly effective strategy for improving classification models, especially when applied to real-world data such as application reviews on digital platforms like Google Play.

Authors

Institutions

Publication Details

Published
2024-10-24
DOI
https://doi.org/10.1109/icic64337.2024.10957541
Citations
4
Primary Topic
Advanced Statistical Methods and Models
Type
article
Field-Weighted Citation Impact
2.84
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing K-Nearest Neighbor Values Using The Elbow Method

Elviawaty Muisa Zamzami, Fahmi Fahmi, Bobby Irawan
4 citations
Advanced Statistical Methods and Models
2.84
article

Optimizing K-Nearest Neighbor Values Using The Elbow Method

Elviawaty Muisa Zamzami, Fahmi Fahmi, Bobby Irawan
article en
4 citations

Abstract

Optimizing the K value in the K-Nearest Neighbor (KNN) algorithm is a critical step in enhancing model performance, particularly for tasks related to classification and prediction. The Elbow method has emerged as a widely used technique for determining the optimal K value by analyzing the point where adding more neighbors does not significantly reduce error or improve model performance. This study focuses on the application of the Elbow method for optimizing the K value in the context of classifying BRIMo application reviews on the Google Play platform. By conducting a comparative analysis between the K value determined by the Elbow method and the traditionally chosen K value in KNN, this research demonstrates the advantages of using the Elbow method for improving classification accuracy. The experimental results reveal that the K value derived from the Elbow method (0.8) outperforms the traditional K value (0.78), resulting in a notable improvement in model performance. This superior accuracy highlights the effectiveness of the Elbow method in selecting a more optimal K value, leading to a better fit for the data and more precise predictions. Consequently, the use of the Elbow method for optimizing the K value in the KNN algorithm proves to be a highly effective strategy for improving classification models, especially when applied to real-world data such as application reviews on digital platforms like Google Play.

Universitas Sumatera Utara (ID)
Openalex Percentile: Top 8%
Advanced Statistical Methods and Models
2.84
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.