847 search results - page 4 / 170 » Approximation algorithms for projective clustering |
STOC
2002
ACM
14 years 7 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
TOMACS
2010
13 years 2 months ago
2010
In this paper, we develop a stochastic approximation method to solve a monotone estimation problem and use this method to enhance the empirical performance of the Q-learning algor...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
SBCCI
2003
ACM
14 years 19 days ago
2003
ACM
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
ISAAC
2005
Springer
14 years 27 days 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...