Key points are not available for this paper at this time.
The K-means algorithm is a popular data-clustering algorithm. However, one of its drawbacks is the requirement for the number of clusters, K, to be specified before the algorithm is applied. This paper first reviews existing methods for selecting the number of clusters for the algorithm. Factors that affect this selection are then discussed and a new measure to assist the selection is proposed. The paper concludes with an analysis of the results of using the proposed measure to determine the number of clusters for the K-means algorithm for different data sets.
Building similarity graph...
Analyzing shared references across papers
Loading...
Pham et al. (Sat,) studied this question.
www.synapsesocial.com/papers/69dc616aac480df60a1332e2 — DOI: https://doi.org/10.1243/095440605x8298
Duc Truong Pham
Stefan Dimov
Cuong Duc Nguyen
Proceedings of the Institution of Mechanical Engineers Part C Journal of Mechanical Engineering Science
Cardiff University
Building similarity graph...
Analyzing shared references across papers
Loading...