Sciweavers

ISAAC
2005
Springer
122views Algorithms» more  ISAAC 2005»
13 years 10 months ago
Fast k-Means Algorithms with Constant Approximation
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran
KDD
2006
ACM
112views Data Mining» more  KDD 2006»
14 years 5 months ago
K-means clustering versus validation measures: a data distribution perspective
K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation...
Hui Xiong, Junjie Wu, Jian Chen