skip to main content

PENGELOMPOKAN DAERAH RAWAN KRIMINALITAS DI INDONESIA TAHUN 2021 MENGGUNAKAN METODE K-MEANS & FUZZY C-MEANS

*Wulan Cahya Rahma Rahmadani  -  Departemen Statistika, Fakultas Sains dan Matematika, Universitas Diponegoro, Indonesia
Tatik Widiharih  -  Departemen Statistika, Fakultas Sains dan Matematika, Universitas Diponegoro, Indonesia
Tarno Tarno  -  Departemen Statistika, Fakultas Sains dan Matematika, Universitas Diponegoro, Indonesia
Open Access Copyright 2026 Jurnal Gaussian under http://creativecommons.org/licenses/by-nc-sa/4.0.

Citation Format:
Abstract
Crime is one of the aspects that can influence national stability and security. In this study, crime data is used to cluster crime-prone areas and is considered whether these areas require extra surveillance or not. This research employs the K-means and Fuzzy C-Means methods. The K-means method groups data based on the similarity of data with cluster centroids. This algorithm is relatively efficient in complexity and easy to understand. K-means explicitly allocates data to specific clusters. On the other hand, Fuzzy C-Means is capable of placing a data point that lies between two or more other clusters into a single cluster. This is due to each data point having a degree of membership to determine its grouping, making the chances of failure to converge or stable cluster centers very low. The optimal number of clusters is selected using validation through the Davies Bouldin Index and Calinski Harabasz Index. The research results indicate that clustering crime-prone areas using both methods yield the same outcome of 2 clusters. Cluster 1 exhibits a higher crime rate compared to cluster 2, as indicated by the higher average values of group members. The lowest Davies Bouldin Index is 1.04948, and the highest Calinski Harabasz Index is around 24.36783.
Keywords: Clustering; k-means; fuzzy c-means; Davies Bouldin Index; Calinski Harabasz Index; Crime

Article Metrics:

Article Info
Section: Articles
Language : EN
  1. Baarsch, J. dan Celebi, M.. (2012) ‘Investigation of Internal Validity Measures for K-Means Clustering’. Available at: https://www.semanticscholar.org/paper/Investigation-of-Internal-Validity-Measures-for-Baarsch-Celebi/6dd2a2d3fb9dddf028283f060fb79a6c1edc9c61
  2. Badan Pusat Statistik (2022) Statistik Kriminal 2022. Available at: https://www.bps.go.id/publication/2022/11/30/4022d3351bf3a05aa6198065/statistik-kriminal-2022.html
  3. Bezdek, J.C. (1981) ‘Pattern Recognition With Fuzzy Objective Function Algorithms’
  4. Calinski, T. dan Harabasz, J. (1974) ‘A dendrite method for cluster analysis’, Communications in Statistics - Theory and Methods, 3(1), pp. 1–27. Available at: https://doi.org/10.1080/03610927408827101
  5. Davies, D.L. dan Bouldin, D.W. (1979) ‘AClusterSeparationMeasure’, pp. 224–227
  6. Hair, J.F., Black, W.C., Babbin, J.B. dan Anderson, R.E. (2006) Multivariate Data Analysis (7th Edition). Available at: https://www.pdfdrive.com/multivariate-data-analysis-7th-edition-d156708931.html
  7. Khang, T.D., Vuong, N.D., Tran, M.-K. dan Fowler, M. (2020) ‘Fuzzy C-Means Clustering Algorithm with Multiple Fuzzification Coefficients’, Algorithms, 13(7), p. 158. Available at: https://doi.org/10.3390/a13070158
  8. Kusumadewi, S. dan Purnomo, H. (2010) Aplikasi Logika Fuzzy untuk pendukung keputusan
  9. MacQueen, J.B. (1967) ‘Some Methods For Classification and Analysis of Multivariate Observations’. Available at: https://www.semanticscholar.org/paper/Some-methods-for-classification-and-analysis-of-MacQueen/ac8ab51a86f1a9ae74dd0e4576d1a019f5e654ed
  10. Patro, S.G.K. dan sahu, K.K. (2015) ‘Normalization: A Preprocessing Stage’, Iarjset, 2(3), pp. 20–22. Available at: https://doi.org/10.17148/iarjset.2015.2305
  11. Prasetyo, E. (2014) Data Mining Mengolah Data menjadi Informasi menggunakan Matlab. Yogyakarta: ANDI
  12. Suyanto (2019) Data Mining untuk Klasifikasi dan Klasterisasi Data. Bandung: Informatika

Last update:

No citation recorded.

Last update:

No citation recorded.