Claim Missing Document
Check
Articles

K-MEANS WITH PARTICLE SWARM OPTIMIZATION FOR ERROR REDUCTION IN MICRO, SMALL, MEDIUM ENTERPISE CRAFT IN YOGYAKARTA Athallah Naufal Muthahhari; Lisna Zahrotun
Scientific Journal of Informatics Vol. 13 No. 1: February 2026
Publisher : Universitas Negeri Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15294/sji.v13i1.40664

Abstract

Purpose: Micro, Small, and Medium Enterprises (MSMEs) in the handicraft sector of Yogyakarta face significant challenges regarding capital access and marketing optimization. This study aims to group 146 MSMEs based on business characteristics to support the formulation of targeted empowerment strategies. Methods/Study design/approach: A quantitative approach was employed using survey data processed through encoding and normalization. The research utilized the K-Means algorithm, optimized with Particle Swarm Optimization (PSO) to determine the optimal number of clusters, and evaluated the model using Sum of Squared Error (SSE) and Mean Absolute Error (MAE). Result/Findings: The results show that the K-Means method optimized with PSO significantly outperforms the standard K-Means algorithm. Specifically, the optimized model achieved an SSE of 51.676 and an MAE of 0.116, compared to the standard K-Means algorithm which produced a higher SSE of 54.555 and an MAE of 0.124. Novelty/Originality/Value: The novelty of this study lies in the application of PSO to minimize clustering errors specifically within the Yogyakarta handicraft sector context. These findings offer a highly accurate, data-driven foundation for policymakers to design effective MSME development programs. 
K-Means Centroid Optimization with Genetic Algorithm for Clustering Micro, Small, Medium Enterprises in Yogyakarta Muhammad Faris Akbar; Lisna Zahrotun
JUITA: Jurnal Informatika JUITA Vol. 13 Issue 2, July 2025
Publisher : Department of Informatics Engineering, Universitas Muhammadiyah Purwokerto

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30595/juita.v13i2.25480

Abstract

K-Means is a widely used data clustering algorithm due to its simplicity and fast performance. However, the weakness of K-Means is in determining the cluster centroid randomly, which can result in suboptimal clustering results, especially since it tends to get stuck on local solutions. This research aims to overcome this weakness by integrating the Genetic Algorithms (GA) into the K-Means process, optimizing the initial centroid, and improving clustering quality. The method combines GA with K-Means on MSME data in Yogyakarta, where GA rearranges the cluster's initial centroid more optimally. The results showed that this method reduced the average value of the Davies-Bouldin Index (DBI) from 1,819 in conventional K-Means to 1,349 with GA integration, indicating an improvement in cluster quality by 25.9%. These results prove that integration of GA with K-Means improves clustering accuracy and improves cluster separation, as measured by a significant decrease in DBI value