Penerapan Algoritme K-Means Dalam Mengelompokkan Data Pengangguran Terbuka Di Provinsi Jawa Barat

  • Muthmainnah T
  • Indriyana S
  • Enri U
N/ACitations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

Unemployment is a major social problem in many regions, including West Java province in Indonesia. West Java province is one of the most populous regions with a high level of urbanization. With population growth and urbanization, the challenge of creating enough jobs becomes more difficult. Therefore, the purpose of this study is to cluster open unemployment data in West Java communities classified by the number of unemployed people by district or city. This research uses CRISP-DM method with K-Means clustering algorithm. The result of this research is 10 regencies/cities that have low level of unemployment, then there are 15 regencies/cities that have medium level of unemployment and there are 2 regencies/cities that have high level of unemployment. The result of the test using Davies Bouldin Index cluster = 3 has the best cluster quality, because the value of the Davies Bouldin Index test result with c = 3 is the smallest value of 0.28, which is the lower, the better the cluster.

Cite

CITATION STYLE

APA

Muthmainnah, T. N., Indriyana, S., & Enri, U. (2023). Penerapan Algoritme K-Means Dalam Mengelompokkan Data Pengangguran Terbuka Di Provinsi Jawa Barat. Jurnal Informatika Dan Rekayasa Perangkat Lunak, 5(2), 122. https://doi.org/10.36499/jinrpl.v5i2.8736

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