A Multi-Objective Particle Swarm OptimizationApproach for Optimizing K-Means Clustering Centroids

A Multi-Objective Particle Swarm OptimizationApproach for Optimizing K-Means Clustering Centroids

centroid; k-means; multiobjective particle swarm optimization; the sum of square within; the sum of square between

The K-Means algorithm is a popular unsupervised learning method used for data clustering. However, its performance heavily depends on centroid initialization and the distribution shape of the data, making it less effective for datasets with complex or non-linear cluster structures. This study evaluates the performance of the standard K-Means algorithm and proposes a Multiobjective Particle Swarm Optimization K-Means (MOPSO+K-Means) approach to improve clustering accuracy. The evaluation was conducted on five benchmark datasets: Atom, Chainlink, EngyTime, Target, and TwoDiamonds. Experimental results show that K-Means is effective only on datasets with clearly separated clusters, such as EngyTime and TwoDiamonds, achieving accuracies of 95.6% and 100%, respectively. In contrast, MOPSO+K-Means achieved a substantial accuracy improvement on the complex Target dataset, increasing from 0.26% to 59.2%. The TwoDiamonds dataset achieved the most desirable trade-off: it had the lowest SSW (1323.32), relatively high SSB (2863.34), and lowest standard deviation values, indicating compact clusters, good separation, and high consistency across runs. These findings highlight the potential of swarm-based optimization to achieve consistent and accurate clustering results on datasets with varying structural complexity

Aina Latifa Riyana Putri1*, Joko Riyono2, Christina Eni Pujiastuti3, Supriyadi4

https://jurnal.iaii.or.id/index.php/RESTI/article/view/6533/1086

Data Science, Telkom University, Purwokerto, Indonesia

June 21, 2025

FAJAR BAGUS W

PDF

ENGLISH

TEXT