SavedAdd your journal

Journals / Veri Bilimi / 2023 / Cilt: 6 Sayı: 1

Comparison of the methods to determine optimal number of cluster

Optimal küme sayısının belirlenmesinde kullanılan yöntemlerin karşılaştırılması

Fatih Emre ÖZTÜRK
Neslihan DEMİREL
Pages
34–45
Publication Date
2023-06-30
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

According to these criterias, Average Silhouette was given more successful results.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Clustering is an unsupervised learning that divides observations into groups based on their similarity.
📊
Key Findings & Data:The performances of these methods were compared by Rand Index and Meila's Variation of Information (MVI) criteria on nine real data sets where the number of clusters was known in advance.
💡
Conclusion & Impact:According to these criterias, Average Silhouette was given more successful results.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Kümeleme analizi · Ortalama Silüet · Dunn Endeksi

Abstract

Clustering is an unsupervised learning that divides observations into groups based on their similarity. The most widely used clustering algorithm is k-means. However, in this clustering algorithm, the number of clusters needs to be determined in advance. In this study, the most widely used methods for determining the number of clusters, namely Average Silhouette, Caliński-Harabasz, Davies-Bouldin and Dunn Index were used. The performances of these methods were compared by Rand Index and Meila's Variation of Information (MVI) criteria on nine real data sets where the number of clusters was known in advance. According to these criterias, Average Silhouette was given more successful results.

Özet

Kümeleme, gözlemleri benzerliklerine göre gruplarına ayıran bir denetimsiz öğrenme şeklidir. En yaygın olarak kullanılan kümeleme algoritması k-ortalamadır. Ancak bu kümeleme algoritmasında küme sayısının önceden belirlenmesi gerekmektedir. Bu çalışmada en çok kullanılan küme sayısı belirleme yöntemlerinden Ortalama Silüet (Average Silhouette), Caliński-Harabasz, Davies-Bouldin ve Dunn Endeksi kullanılmıştır. Bu yöntemlerin performansları küme sayısı önceden belli olan dokuz gerçek veri seti üzerinde Rand Endeksi ve Meila bilgi kriteri (Meila’s Variation of Information-MVI) kriterleri ile karşılaştırılmıştır. Bu kriterlere göre değerlendirildiğinde Ortalama Silüet ile daha başarılı sonuçlar elde edilmiştir.

🔖

Cite This Article

ÖZTÜRK, F. E., DEMİREL, N. (2023). Comparison of the methods to determine optimal number of cluster. Veri Bilimi, Cilt: 6 Sayı: 1, 34–45. https://ajindex.com/articles/947273

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (2)

  1. El Naqa, I., & Murphy, M. J. What is machine learning?. In machine learning in radiation oncology (pp. 3-11).
  2. Springer, Cham. 2015 [2] Learned-Miller, E. G. Introduction to supervised learning. I: Department of Computer Science, University of Massachusetts, 3. 2014 [3] Hady, M. F. A., & Schwenker, F. Semi-supervised learning. Handbook on Neural Information Processing, 215-239. 2013 [4] Hinton, G., & Sejnowski, T. J. (Eds.). Unsupervised learning: foundations of neural computation. MIT press. 1999 [5] Holzinger, K. J., & Harman, H. H. Factor analysis; a synthesis of factorial methods. 1941 [6] Sokal, R. R. Numerical taxonomy. Scientific American, 215(6), 106-117. 1966 [7] Barbará, D., & Jajodia, S. (Eds.). Applications of data mining in computer security (Vol. 6). Springer Science & Business Media. 2002 [8] Mirkin, B. Clustering for data mining: a data recovery approach. Chapman and Hall/CRC. 2005 [9] Chou, C. H., Su, M. C., & Lai, E. A new cluster validity measure and its application to image compression. Pattern Analysis and Applications, 7(2), 205-220. 2004 [10] Arbelaitz, O., Gurrutxaga, I., Muguerza, J., Pérez, J. M., & Perona, I. An extensive comparative study of cluster validity indices. Pattern recognition, 46(1), 243-256. 2013 [11] Berthold, M. R., & Höppner, F. On clustering time series using euclidean distance and pearson correlation. arXiv preprint arXiv:1601.02213. 2016 [12] Kassambara, A. Practical guide to cluster analysis in R: Unsupervised machine learning (Vol. 1). Sthda. 2017 [13] Marutho, D., Handaka, S. H., & Wijaya, E. The determination of cluster number at k-mean using elbow method and purity evaluation on headline news. In 2018 international seminar on application for technology of information and communication (pp. 533-538). IEEE. 2018, September [14] Govender, P., & Sivakumar, V. Application of k- means and hierarchical clustering techniques for analysis of air pollution: A review (1980–2019). Atmospheric pollution research, 11(1), 40-56,2020 [15] Sinaga, K. P., & Yang, M. S. Unsupervised K-means clustering algorithm. IEEE access, 8, 80716-80727. 2020 [16] Yuan, C., & Yang, H. Research on K-value selectionmethod of K-means clustering algorithm. J, 2(2), 226- 235. 2019 [17] Celebi, M. E., Kingravi, H. A., & Vela, P. A. A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert systems with applications, 40(1), 200-210. 2013 [18] Hartigan, J. A., & Wong, M. A. Algorithm AS 136: A K-Means