Sciweavers

845 search results - page 1 / 169
» Adaptive K-Means Clustering
Sort
View
ISAAC
2005
Springer
122views Algorithms» more  ISAAC 2005»
14 years 4 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
PODS
2004
ACM
158views Database» more  PODS 2004»
14 years 11 months ago
k-Means Projective Clustering
Pankaj K. Agarwal, Nabil H. Mustafa
ICIC
2005
Springer
14 years 4 months ago
Methods of Decreasing the Number of Support Vectors via k-Mean Clustering
This paper proposes two methods which take advantage of k -mean clustering algorithm to decrease the number of support vectors (SVs) for the training of support vector machine (SVM...
Xiao-Lei Xia, Michael R. Lyu, Tat-Ming Lok, Guang-...
FOCS
2010
IEEE
13 years 9 months ago
Stability Yields a PTAS for k-Median and k-Means Clustering
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...
Pranjal Awasthi, Avrim Blum, Or Sheffet
MLDM
2010
Springer
13 years 5 months ago
Fast Algorithms for Constant Approximation k-Means Clustering
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