We run experiments showing that algorithm clarans (, 2005) finds better K-medoids solutions than the Voronoi iteration algorithm. This finding, along with the similarity between the Voronoi iteration algorithm and Lloyd's K-means algorithm, suggests that clarans may be an effective K-means initializer. We show that this is the case, with clarans outperforming other seeding algorithms on 23 23 datasets with a mean decrease over K-means++ of 30 for initialization mse and 3 or final mse. We describe how the complexity and runtime of clarans can be improved, making it a viable initialization scheme for large datasets.
Alternatives to have been considered which resemble the swapping approach of . One is by @cite_5 , where points are randomly selected and reassigned. @cite_4 show how this heuristic can result in better clustering when there are few points per cluster.
@cite_5 @cite_4
2142827986 1916116059
This paper presents the top 10 data mining algorithms identified by the IEEE International Conference on Data Mining (ICDM) in December 2006: C4.5, k-Means, SVM, Apriori, EM, PageRank, AdaBoost, kNN, Naive Bayes, and CART. These top 10 algorithms are among the most influential data mining algorithms in the research community. With each algorithm, we provide a description of the algorithm, discuss the impact of the algorithm, and review current and further research on the algorithm. These 10 algorithms cover classification, Hartigan’s method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuristic, one leading to a number of consistency properties, the other showing that the data partition is always quite separated from the induced Voronoi partition. A characterization of the volume of this separation is provided. Empirical tests verify not only good optimization performance relative to Lloyd’s method, but also good running time.