118 search results - page 1 / 24 » Fast Algorithms for Constant Approximation k-Means Clusterin... |
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
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...
MLDM
2010
Springer
12 years 11 months ago
2010
Springer
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...
FOCS
2010
IEEE
13 years 2 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
ALGORITHMICA
2005
13 years 4 months ago
2005
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
The scope of the well-known k-means algorithm has been
broadly extended with some recent results: first, the k-
means++ initialization method gives some approximation
guarantees...