Analisis Algoritma K-Means dan Davies Bouldin Index dalam Mencari Cluster Terbaik Kasus Perceraian di Kabupaten Kuningan
-
Yayan Sopyan
*
STMIK LIKMI, Bandung,
Indonesia
- Agrian Dwi Lesmana STMIK LIKMI, Bandung, Indonesia
- Christina Juliane STMIK LIKMI, Bandung, Indonesia (*) Corresponding Author
Abstract
In marriage, the thing that is most avoided is a divorce. Divorce is the termination of the husband and wife relationship which is carried out legally at the time of trial. From year to year, there is an increase in the number of divorces in Indonesia, including the number of divorces in Kuningan Regency. This study analyzes divorce cases in villages in Kuningan Regency, the analysis is carried out by using data mining clustering methods using the K-Means algorithm. The clustering method is grouping data based on the same characteristics. In determining the number of clusters by using the value of the smallest Davies Bouldin Index, it is hoped that the number of clusters formed can be more optimal. The results of this study are that there are 4 clusters consisting of villages or sub-districts with different divorce rates, namely the highest divorce rate, high divorce rate, medium divorce rate, low divorce rate, and lowest divorce rate
Downloads
References
U. D. Rahayu et al., “Analisis Kasus Perceraian Pada Pengadilan Negeri Bekasi Menggunakan Algoritma K-Means Clustering,” vol. 6, no. 1, pp. 165–172, 2022.
U. T. Wijayanti, “Analisis Faktor Penyebab Perceraian pada Masa Pandemi Covid-19 di Kabupaten Banyumas,” J. Ilmu Kel. dan Konsum., vol. 14, no. 1, pp. 14–26, 2021, doi: 10.24156/jikk.2021.14.1.14.
N. S. Manna, S. Doriza, and M. Oktaviani, “Cerai Gugat: Telaah Penyebab Perceraian Pada Keluarga di Indonesia,” J. Al-AZHAR Indones. SERI Hum., vol. 6, no. 1, p. 11, 2021, doi: 10.36722/sh.v6i1.443.
D. Laila Sari, M. Saputra, and H. Gemasih, “Penerapan Data Mining Dalam Proses Prediksi Perceraian Menggunakan Algoritma Naive Bayes Di Kabupaten Aceh Tengah,” J. Tek. Inform. dan Elektro, vol. 4, no. 1, pp. 23–35, 2022, doi: 10.55542/jurtie.v4i1.112.
S. Muhammad, “The phenomenon of Contested Divorced in Kuningan District : A Study of Social Change in Society and Family Fenomena Cerai Gugat di Kabupaten Kuningan : Sebuah Kajian Perubahan Sosial dalam Masyarakat dan Keluarga,” J. Bimas Islam, vol. 9, pp. 599–640, 2016.
S. Sulistiyana, Dian Ade Kurnia, and Martanto, “Pembangunan Model Clustering Dalam Pengelompokan Pengadilan Agama Berdasarkan Kasus Perceraian Dengan Menggunakan Algoritma K-Means,” KOPERTIP J. Ilm. Manaj. Inform. dan Komput., vol. 5, no. 2, p. 57, Oct. 2021, doi: 10.32485/kopertip.v5i2.165.
S. Humairoh Sa, M. Safii, I. Parlina, S. Tunas Bangsa Pematangsiantar, and J. A. Sudirman Blok No, “Prosiding Seminar Nasional Riset Information Science (SENARIS) Analisa Metode K-Means dalam Mengelompokkan Perkara Perceraian Berdasarkan Daerah Simalungun,” 2019.
A. R. Hedar, A. M. M. Ibrahim, A. E. Abdel-Hakim, and A. A. Sewisy, “K-means cloning: Adaptive spherical K-means clustering,” Algorithms, vol. 11, no. 10, pp. 1–22, 2018, doi: 10.3390/a11100151.
D. Triyansyah and D. Fitrianah, “Analisis Data Mining Menggunakan Algoritma K-Means Clustering Untuk Menentukan Strategi Marketing,” J. Telekomun. dan Komput., vol. 8, no. 3, p. 163, 2018, doi: 10.22441/incomtech.v8i3.4174.
N. Azwanti, “Segmentasi Tingkat Pemakaian Material dengan Data Mining Clustering,” J. Komput. Terap., vol. 4, no. 2, pp. 16–27, 2018, [Online]. Available: https://jurnal.pcr.ac.id/index.php/jkt/article/view/2102
V. Miralda, M. Zarlis, and E. Irawan, “Penerapan Metode K-Means Clustering Untuk Daging Ayam Buras,” Build. Informatics, Technol. Sci., vol. 2, no. 2, pp. 91–98, 2020, doi: 10.47065/bits.v2i2.493.
S. Ginting, S. Efendi, and S. Suwilo, “Performance Improvement of Grid Mapping K-Means with the Average Value at Grid Point,” IOP Conf. Ser. Earth Environ. Sci., vol. 1083, no. 1, pp. 1–10, 2022, doi: 10.1088/1755-1315/1083/1/012082.
N. Laili, N. S. Indrasti, and D. Wahyudi, “Design of sustainable coffee processing wastewater treatment system using K-means clustering algorithm,” IOP Conf. Ser. Earth Environ. Sci., vol. 1063, no. 1, pp. 1–8, 2022, doi: 10.1088/1755-1315/1063/1/012032.
Y. K. Saheed, M. O. Arowolo, and A. U. Tosho, “An Efficient Hybridization of K-Means and Genetic Algorithm Based on Support Vector Machine for Cyber Intrusion Detection System,” Int. J. Electr. Eng. Informatics, vol. 14, no. 2, pp. 426–442, 2022, doi: 10.15676/ijeei.2022.14.2.11.
N. L. W. S. R. Ginantra et al., Data mining dan penerapan algoritma. Yayasan Kita Menulis, 2021.
X. Ling, Q. Tu, M. Jin, W. Wang, Y. Cui, and J. Zhu, “Research on Distributed Resource Aggregation Technology,” vol. 2399, no. Icpset, pp. 1–8, 2022, doi: 10.1088/1742-6596/2399/1/012034.
Y. A. Wijaya, D. A. Kurniady, E. Setyanto, W. S. Tarihoran, D. Rusmana, and R. Rahim, “Davies Bouldin Index Algorithm for Optimizing Clustering Case Studies Mapping School Facilities,” TEM J., vol. 10, no. 3, pp. 1099–1103, 2021, doi: 10.18421/TEM103-13.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Analisis Algoritma K-Means dan Davies Bouldin Index dalam Mencari Cluster Terbaik Kasus Perceraian di Kabupaten Kuningan
Pages: 1464−1470
Copyright (c) 2022 Yayan Sopyan, Agrian Dwi Lesmana, Christina Juliane
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).
