231 search results - page 9 / 47 » Sublinear time approximate clustering |
MLDM
2010
Springer
13 years 2 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...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
SODA
2001
ACM
13 years 8 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the data from ...