K-Means and AHC Methods for Classifying Crime Victims by Indonesian Provinces: A Comparative Analysis
-
Ridha Maya Faza Lubis
*
Southern Taiwan University of Science and Technology,
Taiwan, Province of China
- Jen-Peng Huang Southern Taiwan University of Science and Technology, Taiwan, Province of China
- Pai-Chou Wang Southern Taiwan University of Science and Technology, Taiwan, Province of China
- Nurafni Damanik National Taipei University of Technology, Taiwan, Province of China
- Ade Clinton Sitepu National Taipei University of Technology, Taiwan, Province of China
- Ceria D Simanullang Southern Taiwan University of Science and Technology, Taiwan, Province of China (*) Corresponding Author
Abstract
Crime is a common phenomenon that often occurs in society and has a negative impact both individually and collectively. Gaining a deeper understanding of crime can help us tackle the problem more efficiently. In an era that is increasingly complex and globally connected as it is now, crime has undergone significant developments and changes. Crime remains a serious threat to our security, integrity, and well-being. Some common types of crime include theft, robbery, fraud, physical abuse, and murder. Crime can happen anytime and anywhere. To tackle crime, data mining techniques can be used to analyze the surrounding situation and gain new knowledge. One approach is to classify provinces based on crime data from previous years so that crime-prone areas can be identified and security measures can be increased. In this study, two grouping methods were used, namely K-Means and AHC using the complete linkage mode. There are 34 provinces in Indonesia which are grouped based on the number of victims of crime from 2019 to 2021. The grouping results using the K-Means method yield two groups with 17 provinces each. However, using the AHC complete linkage method, there is a difference in the number of provinces between cluster 0 and cluster 1 compared to the K-Means results. In addition, there are differences in the location of the province in the cluster between the two methods. In the K-Means method, provincial data is located in cluster 0, while in the AHC method, the province's data is in cluster 1. Thus, this study provides insight into crime in Indonesia and provides information about the grouping of provinces based on crime rates using the K-Means method. Means and AHC
Downloads
References
A. S. L. T. T. H. Hafizah, “Data Mining Estimasi Biaya Produksi Ikan Kembung Rebus Dengan Regresi Linier Berganda,” J. Sist. Inf. Triguna Dharma (JURSI TGD), no. Vol 1, No 6 (2022): EDISI NOVEMBER 2022, pp. 888–897, 2022.
Y. L. Nainel, E. Buulolo, and I. Lubis, “Penerapan Data Mining Untuk Estimasi Penjualan Obat Berdasarkan Pengaruh Brand Image Dengan Algoritma Expectation Maximization (Studi Kasus: PT. Pyridam Farma Tbk),” JURIKOM (Jurnal Ris. Komputer), vol. 7, no. 2, p. 214, 2020.
M. Azhari, Z. Situmorang, and R. Rosnelly, “Perbandingan Akurasi, Recall, dan Presisi Klasifikasi pada Algoritma C4.5, Random Forest, SVM dan Naive Bayes,” J. Media Inform. Budidarma, vol. 5, no. 2, p. 640, 2021.
S. Widaningsih, “Perbandingan Metode Data Mining Untuk Prediksi Nilai Dan Waktu Kelulusan Mahasiswa Prodi Teknik Informatika Dengan Algoritma C4,5, Naïve Bayes, Knn Dan Svm,” J. Tekno Insentif, vol. 13, no. 1, pp. 16–25, 2019.
H. Maulidiya and A. Jananto, “Asosiasi Data Mining Menggunakan Algoritma Apriori dan FP-Growth sebagai Dasar Pertimbangan Penentuan Paket Sembako,” Proceeding SENDIU 2020, vol. 6, pp. 36–42, 2020.
E. P. Priambodo and A. Jananto, “Perbandingan Analisis Cluster Algoritma K-Means Dan AHC Dalam Perencanaan Persediaan Barang Pada Perusahaan Manufaktur,” Progresif J. Ilm. Komput., vol. 18, no. 2, p. 257, 2022.
A. Supriyadi, A. Triayudi, and I. D. Sholihati, “Perbandingan algoritma k-means dengan k-medoids pada pengelompokan armada kendaraan truk berdasarkan produktivitas,” JIPI (Jurnal Ilm. Penelit. dan Pembelajaran Inform., vol. 6, no. 2, pp. 229–240, 2021.
H. D. Tampubolon, D. Gultom, L. Y. Hutabarat, F. I. R. H. Zer, and D. Hartama, “Penerapan Algoritma K-Means Untuk Mengetahui Tingkat Tindak Kejahatan Daerah Pematangsiantar,” J. Teknol. Inf., vol. 4, no. 1, pp. 146–151, 2020.
N. G. P. R. TARAM, I. K. G. SUKARSA, and I. G. A. M. SRINADI, “Pengelompokan Tingkat Kriminalitas Dengan Metode Agglomerative Dan K-Means Serta Peubah Pencirinya,” E-Jurnal Mat., vol. 8, no. 2, p. 102, 2019.
R. H. Sukarna and Y. Ansori, “Implementasi Data Mining Menggunakan Metode Naive Bayes Dengan Feature Selection Untuk Prediksi Kelulusan Mahasiswa Tepat Waktu,” J. Ilm. Sains dan Teknol., vol. 6, no. 1, pp. 50–61, 2022.
F. O. Lusiana, I. Fatma, and A. P. Windarto, “Estimasi Laju Pertumbuhan Penduduk Menggunakan Metode Regresi Linier Berganda Pada BPS Simalungun,” J. Informatics Manag. Inf. Technol., vol. 1, no. 2, pp. 79–84, 2021.
Z. Nabila, A. Rahman Isnain, and Z. Abidin, “Analisis Data Mining Untuk Clustering Kasus Covid-19 Di Provinsi Lampung Dengan Algoritma K-Means,” J. Teknol. dan Sist. Inf., vol. 2, no. 2, p. 100, 2021.
G. Gunadi and D. I. Sensuse, “Penerapan Metode Data Mining Market Basket Analysis Terhadap Data Penjualan Produk Buku Dengan Menggunakan Algoritma Apriori Dan Frequent Pattern Growth ( Fp-Growth ) :,” Telematika, vol. 4, no. 1, pp. 118–132, 2012.
A. Z. Siregar, “Implementasi Metode Regresi Linier Berganda Dalam Estimasi Tingkat Pendaftaran Mahasiswa Baru,” Kesatria J. Penerapan Sist. Inf. (Komputer dan Manajemen), vol. 2, no. 3, pp. 133–137, 2021.
S. S. S, A. T. Purba, V. Marudut, M. Siregar, T. Komputer, and P. B. Indonesia, “SISTEM PENDUKUNG KEPUTUSAN KELAYAKAN PEMBERIAN PINJAMAN,” vol. 3, pp. 25–30, 2020.
M. M. Effendi, “Menentukan Prediksi Kelulusan Siswa Dengan Membandingkan Algoritma C4. 5 Dan Naive Bayes Studi Kasus SMKN. 1 Cikarang Selatan,” J. SIGMA, vol. 11, no. 3, pp. 143–148, 2020.
S. U. Putri, E. Irawan, and F. Rizky, “Implementasi Data Mining Untuk Prediksi Penyakit Diabetes Dengan Algoritma C4. 5,” Kesatria J. Penerapan Sist. Inf. (Komputer dan Manajemen), vol. 2, no. 1, pp. 39–46, 2021.
S. Widaningsih, “Perbandingan Metode Data Mining Untuk Prediksi Nilai Dan Waktu Kelulusan Mahasiswa Prodi Teknik Informatika Dengan Algoritma C4, 5, Naïve Bayes, Knn Dan Svm,” J. Tekno Insentif, vol. 13, no. 1, pp. 16–25, 2019.
F. Harahap, “Perbandingan Algoritma K Means dan K Medoids Untuk Clustering Kelas Siswa Tunagrahita,” TIN Terap. Inform. Nusant., vol. 2, no. 4, pp. 191–197, 2021.
M. A. Rofiq, A. Qoiriah, S. Kom, and M. Kom, “Pengelompokan Kategori Buku Berdasarkan Judul Menggunakan Algoritma Agglomerative Hierarchical Clustering Dan K-Medoids,” J. Informatics Comput. Sci., vol. 2, no. 03, pp. 220–227, 2021.
B. Harli Trimulya Suandi As and L. Zahrotun, “PENERAPAN DATA MINING DALAM MENGELOMPOKKAN DATA RIWAYAT AKADEMIK SEBELUM KULIAH DAN DATA KELULUSAN MAHASISWA MENGGUNAKAN METODE AGGLOMERATIVE HIERARCHICAL CLUSTERING (Implementation Of Data Mining In Grouping Academic History Data Before Students And Stud,” J. Teknol. Informasi, Komput. dan Apl., vol. 3, no. 1, pp. 62–71, 2021.
A. Damuri, U. Riyanto, H. Rusdianto, and M. Aminudin, “Implementasi Data Mining dengan Algoritma Naïve Bayes Untuk Klasifikasi Kelayakan Penerima Bantuan Sembako,” JURIKOM (Jurnal Ris. Komputer), vol. 8, no. 6, pp. 219–225, 2021.
I. A. Nikmatun and I. Waspada, “Implementasi Data Mining untuk Klasifikasi Masa Studi Mahasiswa Menggunakan Algoritma K-Nearest Neighbor,” Simetris J. Tek. Mesin, Elektro dan Ilmu Komput., vol. 10, no. 2, pp. 421–432, 2019.
H. Hozairi, A. Anwari, and S. Alim, “Implementasi Orange Data Mining Untuk Klasifikasi Kelulusan Mahasiswa Dengan Model K-Nearest Neighbor, Decision Tree Serta Naive Bayes,” Netw. Eng. Res. Oper., vol. 6, no. 2, pp. 133–144, 2021.
H. Maulidiya and A. Jananto, “Asosiasi Data Mining Menggunakan Algoritma Apriori Dan Fpgrowth Sebagai Dasar Pertimbangan Penentuan Paket Sembako,” 2020.
K. Erwansyah, B. Andika, and R. Gunawan, “Implementasi Data Mining Menggunakan Asosiasi Dengan Algoritma Apriori Untuk Mendapatkan Pola Rekomendasi Belanja Produk Pada Toko Avis Mobile,” J. Teknol. Sist. Inf. dan Sist. Komput. TGD, vol. 4, no. 1, pp. 148–161, 2021.
A. Rivandi, E. Bu’ulolo, and N. Silalahi, “Penerapan Metode Regresi Linier Berganda Dalam Estimasi Biaya Pencetakan Spanduk (Studi Kasus: PT. Hansindo Setiapratama),” Pelita Inform. Inf. dan Inform., vol. 7, no. 3, pp. 263–268, 2019.
P. Purwadi, P. S. Ramadhan, and N. Safitri, “Penerapan Data Mining Untuk Mengestimasi Laju Pertumbuhan Penduduk Menggunakan Metode Regresi Linier Berganda Pada BPS Deli Serdang,” J. SAINTIKOM (Jurnal Sains Manaj. Inform. dan Komputer), vol. 18, no. 1, pp. 55–61, 2019.
. F., F. T. Kesuma, and S. P. Tamba, “Penerapan Data Mining Untuk Menentukan Penjualan Sparepart Toyota Dengan Metode K-Means Clustering,” J. Sist. Inf. dan Ilmu Komput. Prima(JUSIKOM PRIMA), vol. 2, no. 2, pp. 67–72, 2020.
S. A. Rahmah, “KLASTERISASI POLA PENJUALAN PESTISIDA MENGGUNAKAN METODE K-MEANS CLUSTERING ( STUDI KASUS DI TOKO JUANDA TANI KECAMATAN HUTABAYU RAJA ),” vol. 1, no. 1, pp. 1–5, 2020.
W. Purba, W. Siawin, and . H., “Implementasi Data Mining Untuk Pengelompokkan Dan Prediksi Karyawan Yang Berpotensi Phk Dengan Algoritma K-Means Clustering,” J. Sist. Inf. dan Ilmu Komput. Prima(JUSIKOM PRIMA), vol. 2, no. 2, pp. 85–90, 2019.
R. A. Setyawan and R. M. Fadilla, “Klasterisasi media pembelajaran daring di era pandemi COVID-19 menggunakan metode Agglomerative,” Inf. Interaktif, vol. 5, no. 3, 2020.
Marjiyono, “Penerapan Algoritma Ahc Algorithm Dalam Aplikasi Ppembagian Kelas Siswa Baru,” Semin. Nas. Teknol. Inf. dan Multimed. 2015, pp. 6–8, 2015.
T. Li, A. Rezaeipanah, and E. M. T. El Din, “An ensemble agglomerative hierarchical clustering algorithm based on clusters clustering technique and the novel similarity measurement,” J. King Saud Univ. Inf. Sci., vol. 34, no. 6, pp. 3828–3842, 2022.
R. T. Adek, R. K. Dinata, and A. Ditha, “Online Newspaper Clustering in Aceh using the Agglomerative Hierarchical Clustering Method,” Int. J. Eng. Sci. Inf. Technol., vol. 2, no. 1, pp. 70–75, 2022.
P. Govender and V. Sivakumar, “Application of k-means and hierarchical clustering techniques for analysis of air pollution: A review (1980–2019),” Atmos. Pollut. Res., vol. 11, no. 1, pp. 40–56, 2020.
C. Briggs, Z. Fan, and P. Andras, “Federated learning with hierarchical clustering of local updates to improve training on non-IID data,” in 2020 International Joint Conference on Neural Networks (IJCNN), 2020, pp. 1–9.
K. Zeng, M. Ning, Y. Wang, and Y. Guo, “Hierarchical clustering with hard-batch triplet loss for person re-identification,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020, pp. 13657–13665.
N. K. Zuhal, “Study Comparison K-Means Clustering dengan Algoritma Hierarchical Clustering,” Pros. Semin. Nas. Teknol. dan Sains, vol. 1, pp. 200–205, 2022.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel K-Means and AHC Methods for Classifying Crime Victims by Indonesian Provinces: A Comparative Analysis
Pages: 295−307
Copyright (c) 2023 Ridha Maya Faza Lubis, Jen-Peng Huang, Pai-Chou Wang, Nurafni Damanik, Ade Clinton Sitepu, Ceria D Simanullang
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
