Melola Discovery

← Melola Discovery

Jurnal Tanpa peringkat SINTA

K-MEANS WITH PARTICLE SWARM OPTIMIZATION FOR ERROR REDUCTION IN MICRO, SMALL, MEDIUM ENTERPISE CRAFT IN YOGYAKARTA

Scientific Journal of Informatics · Vol. 13 No. 1 (2026) · hlm. 217–230

DOI
10.15294/sji.v13i1.40664
ISSN
2407-7658, 2460-0040
Terbit
2026-04-06
Penerbit
Universitas Negeri Semarang
Bahasa
eng

Abstrak

Purpose: This study aims to optimize the determination of the optimal number of clusters in the segmentation of handicraft-based Micro, Small, and Medium Enterprises (MSMEs) in Yogyakarta to support targeted and data-driven development strategies. Approach: A quantitative approach was applied to survey data collected from 145 MSMEs. The analytical pipeline consisted of four stages: (1) data acquisition through structured surveys, (2) preprocessing including encoding, mode imputation for missing values, and Min–Max normalization, (3) model development using the K-Means algorithm integrated with Particle Swarm Optimization (PSO) to automatically search for the optimal cluster number (K = 2–10), and (4) performance evaluation using Silhouette Score, Sum of Squared Error (SSE), and Mean Absolute Error (MAE). Result: The optimization process consistently converged to an optimal configuration of K = 8 clusters. Compared to standard K-Means, the proposed K-Means + PSO model reduced SSE from 54.555 to 51.676 and MAE from 0.124 to 0.116, indicating improved clustering stability and compactness. Semantic centroid analysis further revealed a hierarchical MSME structure consisting of Established Digital Adopters, Developing Potential Enterprises, and Subsistence Micro Enterprises, highlighting disparities in digital maturity and market reach. Novelty: This study contributes by integrating swarm-based optimization with centroid-driven semantic profiling, bridging algorithmic enhancement and policy-relevant interpretation. The proposed framework provides a robust and interpretable clustering model for MSME segmentation in emerging economic contexts.

Kata kunci

Jaringan kolaborasi para penulis

2 penulis · 1 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universitas Ahmad Dahlan
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unnes.ac.id/journals/sji/oai, pertama di-harvest 6 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en">K-MEANS WITH PARTICLE SWARM OPTIMIZATION FOR ERROR REDUCTION IN MICRO, SMALL, MEDIUM ENTERPISE CRAFT IN YOGYAKARTA</dc:title>
	<dc:creator xml:lang="en">Muthahhari, Athallah Naufal</dc:creator>
	<dc:creator xml:lang="en">Zahrotun, Lisna</dc:creator>
	<dc:subject xml:lang="en">Clustering</dc:subject>
	<dc:subject xml:lang="en">MSME craft</dc:subject>
	<dc:subject xml:lang="en">K-Means algorithm</dc:subject>
	<dc:subject xml:lang="en">PSO optimization</dc:subject>
	<dc:description xml:lang="en">Purpose: This study aims to optimize the determination of the optimal number of clusters in the segmentation of handicraft-based Micro, Small, and Medium Enterprises (MSMEs) in Yogyakarta to support targeted and data-driven development strategies.
Approach: A quantitative approach was applied to survey data collected from 145 MSMEs. The analytical pipeline consisted of four stages: (1) data acquisition through structured surveys, (2) preprocessing including encoding, mode imputation for missing values, and Min–Max normalization, (3) model development using the K-Means algorithm integrated with Particle Swarm Optimization (PSO) to automatically search for the optimal cluster number (K = 2–10), and (4) performance evaluation using Silhouette Score, Sum of Squared Error (SSE), and Mean Absolute Error (MAE).
Result: The optimization process consistently converged to an optimal configuration of K = 8 clusters. Compared to standard K-Means, the proposed K-Means + PSO model reduced SSE from 54.555 to 51.676 and MAE from 0.124 to 0.116, indicating improved clustering stability and compactness. Semantic centroid analysis further revealed a hierarchical MSME structure consisting of Established Digital Adopters, Developing Potential Enterprises, and Subsistence Micro Enterprises, highlighting disparities in digital maturity and market reach.
Novelty: This study contributes by integrating swarm-based optimization with centroid-driven semantic profiling, bridging algorithmic enhancement and policy-relevant interpretation. The proposed framework provides a robust and interpretable clustering model for MSME segmentation in emerging economic contexts.</dc:description>
	<dc:publisher xml:lang="en">Universitas Negeri Semarang</dc:publisher>
	<dc:date>2026-04-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unnes.ac.id/journals/sji/article/view/40664</dc:identifier>
	<dc:identifier>10.15294/sji.v13i1.40664</dc:identifier>
	<dc:source xml:lang="en">Scientific Journal of Informatics; Vol. 13 No. 1: Regular Issue; 217-230</dc:source>
	<dc:source>2407-7658</dc:source>
	<dc:source>2460-0040</dc:source>
	<dc:source>10.15294/sji.v13i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.unnes.ac.id/journals/sji/article/view/40664/9105</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2026 Scientific Journal of Informatics</dc:rights>
</oai_dc:dc>