Analisis Performa Algoritma K-Means Clustering untuk Segmentasi Pasar di UMKM

  • Afrizal M
  • Saputra I
  • Satria R
  • et al.
N/ACitations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

This study aims to analyze the performance of the K-Means Clustering algorithm in market segmentation for Micro, Small, and Medium Enterprises (MSMEs). Using a quantitative approach, the data collected includes demographic information, purchasing behavior, and product preferences from respondents. The analysis process begins with data preprocessing, including normalization and outlier removal, before applying the K-Means algorithm to group customers into several segments. The performance evaluation of the algorithm is conducted using the Silhouette Score and Davies-Bouldin Index metrics. The analysis results indicate that the K-Means algorithm successfully identifies four distinct customer clusters, each with unique characteristics. The average Silhouette Score of 0.72 and a Davies-Bouldin Index of 0.45 suggest that the resulting clusters are well-defined and clearly separated. These findings provide valuable insights for MSMEs in formulating more effective and targeted marketing strategies.

Cite

CITATION STYLE

APA

Afrizal, M., Saputra, I., Satria, R., & Rahmaddeni, R. (2025). Analisis Performa Algoritma K-Means Clustering untuk Segmentasi Pasar di UMKM. VISA: Journal of Vision and Ideas, 5(2). https://doi.org/10.47467/visa.v5i2.6942

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free