Penerapan Principal Component Analysis untuk Reduksi Variabel pada Algoritma K-Means Clustering

  • Rosyada I
  • Utari D
N/ACitations
Citations of this article
40Readers
Mendeley users who have this article in their library.

Abstract

K-Means clustering is a widely used clustering algorithm. However, it has the disadvantage that the performance of clustering data decreases if the variables of the processed data are immense. The complex variables problem in K-Means can be overcome by combining the Principal Component Analysis (PCA) variable reduction method. This study uses seven indicator variables for the welfare of the people of West Java Province in 2021 to measure the welfare level of districts/cities. The results of the analysis obtained two principal components based on eigenvalues. Clustering from cluster analysis with the K-Means with variable reduction using PCA formed the three best clusters where the number of members of each cluster consisted of 12, 8, and 7 districts/cities.

Cite

CITATION STYLE

APA

Rosyada, I. A., & Utari, D. T. (2024). Penerapan Principal Component Analysis untuk Reduksi Variabel pada Algoritma K-Means Clustering. Jambura Journal of Probability and Statistics, 5(1), 6–13. https://doi.org/10.37905/jjps.v5i1.18733

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