Pengukuran Silhouette Score dan Davies-Bouldin Index pada Hasil Cluster K-Means dan DBSCAN

Authors

  • Yasir Hasan Universitas Budi Darma Medan

Keywords:

K-Means Clustering, DBSCAN Clustering, Silhouette Score, Davies-Bouldin_Index, Employee performance

Abstract

eval_uation of Clustering results is a critical step in unsupervised data analysis. Clustering algorithms such as K-Means and DBSCAN are often used, but choosing the right algorithm for a dataset can be challenging. Application of Silhouette Score and Davies-Bouldin Index as internal eval_uation metrics to eval_uate Clustering results from K-Means and DBSCAN. The K-Means and DBSCAN methods were chosen because of their popularity and ability to handle various types of data. The Silhouette Score provides a measure of how well each data point is placed in its own Cluster compared to other Clusters, while the Davies-Bouldin Index eval_uates how far away the Cluster is from the others. This research was carried out by implementing both algorithms on an experimental dataset, namely the employee performance dataset and comparing the eval_uation results using these two metrics. The experimental results of both eval_uation metrics provide useful insights in eval_uating the quality of employee performance Clustering from K-Means and DBSCAN. Thus, the use of the Silhouette Score and Davies-Bouldin Index can be an effective guide in choosing an appropriate Clustering algorithm for a dataset without the need for ground truth labels.

References

F. E. Ozturk, N. Demirel, and M. Bilgisi, “Comparison of the Methods to Determine Optimal Number of Cluster,” 2023. [Online]. Available: www.dergipark.gov.tr/veri

A. Karami and R. Johansson, “Choosing DBSCAN Parameters Automatically using Differential Evolution,” Apr. 2014.

A. Alalousi, R. Razif, M. AbuAlhaj, M. Anbar, and S. Nizam, “A Preliminary Performance eval_uation of K-means, KNN and EM Unsupervised Machine Learning Methods for Network Flow Classification,” International Journal of Electrical and Computer Engineering (IJECE), vol. 6, no. 2, p. 778, Apr. 2016, doi: 10.11591/ijece.v6i2.8909.

S. Suraya, M. Sholeh, and U. Lestari, “eval_uation of Data Clustering Accuracy using K-Means Algorithm,” International Journal of Multidisciplinary Approach Research and Science, vol. 2, no. 01, pp. 385–396, Dec. 2023, doi: 10.59653/ijmars.v2i01.504.

A. A. A and L. R. Nair Associate Professor, “A NOVEL STUDY OF SILHOUETTE METHOD TO SOLVE THE ISSUES OF OUTLIER AND IMPROVE THE QUALITY OF CLUSTER,” Journal of Data Acquisition and Processing, vol. 38, no. 2, pp. 3099–3118, 2023, doi: 10.5281/zenodo.777129.

I. Firman Ashari, E. Dwi Nugroho, R. Baraku, I. N. Yanda, and R. Liwardana, “Analysis of Elbow, Silhouette, Davies-Bouldin, Calinski-Harabasz, and Rand-Index eval_uation on K-Means Algorithm for Classifying Flood-Affected Areas in Jakarta,” 2023. [Online]. Available: http://jurnal.polibatam.ac.id/index._php/JAIC

K. Amrulloh, T. Hendro Pudjiantoro, P. Nurul Sabrina, and A. Id Hadiana, “Comparison Between Davies-Bouldin Index and Silhouette Coefficient eval_uation Methods in Retail Store Sales Transaction Data Clusterization Using K-Medoids Algorithm,” Cimahi, Jul. 2022. [Online]. Available: www.kaggle.com,

C. Yuan and H. Yang, “Research on K-Value Selection Method of K-Means Clustering Algorithm,” J (Basel), vol. 2, no. 2, pp. 226–235, Jun. 2019, doi: 10.3390/j2020016.

M. Hahsler, M. Piekenbrock, and D. Doran, “Dbscan: Fast density-based clustering with R,” J Stat Softw, vol. 91, 2019, doi: 10.18637/jss.v091.i01.

J. Yang, Z. Sun, and Y. Chen, “Fault detection using the clustering-kNN rule for gas sensor arrays,” Sensors (Switzerland), vol. 16, no. 12, Dec. 2016, doi: 10.3390/s16122069.

W. Utomo, “The comparison of k-means and k-medoids algorithms for clustering the spread of the covid-19 outbreak in Indonesia,” ILKOM Jurnal Ilmiah, vol. 13, no. 1, pp. 31–35, Apr. 2021, doi: 10.33096/ilkom.v13i1.763.31-35.

Downloads

Published

2024-04-28

How to Cite

Hasan, Y. (2024). Pengukuran Silhouette Score dan Davies-Bouldin Index pada Hasil Cluster K-Means dan DBSCAN. KAKIFIKOM (Kumpulan Artikel Karya Ilmiah Fakultas Ilmu Komputer), 6(1), 60–74. Retrieved from https://ejournal.ust.ac.id/index.php/KAKIFIKOM/article/view/3938

Issue

Section

Artikel