Selecting Optimal k in the k-means Clustering Algorithm

Journal of Computer & Robotics

دوره 14، شماره 2 - شماره پیاپی 24، مهر 2021، صفحه 21-27   

نوع مقاله: Original Research (Full Papers)

شناسه دیجیتال (DOI): 10.22094/jcr.2021.688694

نویسندگان

Mojtaba Jahanian¹؛ Abbas Karimi^{* 1}؛ Faraneh Zarafshan²

¹Department of Computer Engineering, Faculty of Engineering, Arak Branch,Islamic Azad, University, IRAN, [e-mail]

²Department of Computer Engineering, Faculty of Engineering, Arak Branch, Islamic Azad, University, IRAN, [e-mail]

چکیده

Clustering is one of the essential machine learning algorithms. Data is not labeled in clustering. The most fundamental challenge in clustering algorithms is to choose the correct number of clusters at the beginning of the algorithm. The proper performance of the clustering algorithm depends on selecting the appropriate number of clusters and selecting the optimal right centers. The quality and an optimal number of clusters are essential in algorithm analysis. This article has tried to distinguish our work from other writings by carefully analyzing and comparing existing algorithms and a clear and accurate understanding of all aspects. Also, by comparing other methods using three criteria, the minimum internal distance between points of a cluster and the maximum external distance between clusters and the location of a cluster, we have presented an intelligent method for selecting the optimal number of clusters. In this method, clusters with the lowest error and the lowest internal variance are chosen based on the results obtained from the research.

کلیدواژه‌ها

Clustering Algorithms؛ K-means؛ Clustering؛ the Optimal Number of Clusters