231 search results - page 18 / 47 » Sublinear time approximate clustering |
SODA
2003
ACM
13 years 8 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
FOCS
2010
IEEE
13 years 5 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...
BMCBI
2008
13 years 7 months ago
2008
Background: Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analys...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
This paper introduces a fast data dissemination method for structured peer-to-peer networks. The work is motivated on one side by the increase in non-volatile memory available on ...
IS
2008
13 years 7 months ago
2008
We propose a dimensionality reduction technique for time series analysis that significantly improves the efficiency and accuracy of similarity searches. In contrast to piecewise c...