Optimasi Cluster Pada Data Stunting: Teknik Evaluasi Cluster Sum of Square Error dan Davies Bouldin Index

Deny Jollyta, Syahril Efendi, Muhammad Zarlis, Herman Mawengkang

Abstract


The clusters number optimization problem is a problem that still requires continuous research so that the information produced can be a consideration. Cluster evaluation techniques with Sum of Square Error (SSE) and Davies Bouldin Index (DBI) are techniques that can evaluate the number of clusters from a data test. Research with these two techniques utilizes Stunting data from a number of regions in Indonesia. The result is information on stunting data which is formed from the optimal number of clusters where the largest SSE is formed at k = 5 and the smallest DBI is formed at k = 5, with values of 23.403 and 1,178 respectively. Changes in the number of clusters also influence the information produced and DBI is proven to produce optimal number of clusters that contain information with a better pattern because it has a small intra-cluster value. It is expected that the results of this study can show the performance of the two evaluation techniques in producing the optimal number of clusters so that grouping information is in accordance with the expected pattern.

Full Text:

PDF

References


Sugiyamta, “Sistem Deteksi Kemiripan Dokumen Dengan Algoritma Cosine Similarity dan Single Pass Clustering,” Din. Inform., vol. 7, no. 2, pp. 85–91, 2015.

M. A. Syakur, B. K. Khotimah, E. M. S. Rochman, and B. D. Satoto, “Integration K-Means Clustering Method and Elbow Method for Identification of the Best Customer Profile Cluster,” in IOP Conference Series: Materials Science and Engineering, 2017, vol. 336, no. 1, p. 7.

P. Bholowalia and A. Kumar, “EBK-Means: A Clustering Technique based on Elbow Method and K-Means in WSN,” Int. J. Comput. Appl., vol. 105, no. 9, pp. 17–24, 2014.

Y. Zhang, T. Bouadi, and A. Martin, “An empirical study to determine the optimal k in Ek-NNclus method,” in 5th International Conference on Beleif Functions (BELIEF2018), 2018, vol. 9, pp. 260–268.

Widiarina, “Algoritma Cluster Dinamik Untuk Optimasi Cluster Pada Algoritma K-Means Dalam Pemetaan Nasabah Potensial,” J. Intell. Syst., vol. 1, no. 1, pp. 33–36, 2015.

I. D. Apriliyaningsih and D. Istiawan, “Penerapan Seleksi Atribut Berdasarkan Koefisien Variansi dan Korelasi untuk Inisialisasi Pusat Awal Klaster pada Algoritma K- Means dalam Pemetaan E-Government Tahun 2016,” in Jurnal University Research Colloquium 2017 Universitas Muhammadiyah Magelang, 2017, no. September, pp. 245–250.

M. Toumi, A. Maizate, M. Ouzzif, and M. S. Salah, “Dynamic clustering algorithm for tracking target with high and variable celerity (ATHVC),” J. Comput. Networks Commun., no. 10, pp. 475–480, 2016.

N. P. E. Merliana, Ernawati, and A. J. Santoso, “Analisa Penentuan Jumlah Cluster Terbaik Pada Metode K-Means Clustering,” in Prosiding Seminar Nasional Multi Disiplin Ilmu&Call for Papers Unisbank (Sendi_U), 2015, pp. 978–979.

H. P. Duvvada, G. D. R. Naidu, and V. D. Sri, “K-Means Cluster Analysis Of Cities Based On Their,” Int. J. Eng. Dev. Res., vol. 5, no. 4, pp. 1356–1363, 2017.

Irwanto, Y. Purwananto, and R. Soelaiman, “Optimasi Kinerja Algoritma Klasterisasi K-Means untuk Kuantisasi Warna Citra,” J. Tek. ITS, vol. 1, no. 1, pp. A197–A202, 2012.

P. Fränti, “Introduction,” in Cluster Validation, 2017.

Kementrian Kesehatan RI, “Situasi Balita Pendek (stunting) di Indonesia,” Kementerian Kesehatan RI, vol. 1, pp. 1–43, 2018.




DOI: http://dx.doi.org/10.30645/senaris.v1i0.100

Refbacks

  • There are currently no refbacks.


&nbsp