Sciweavers

45 search results - page 1 / 9
» Approximate clustering via core-sets
Sort
View
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
14 years 5 months ago
Approximate clustering via core-sets
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...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
SIGMOD
2011
ACM
269views Database» more  SIGMOD 2011»
12 years 8 months ago
Advancing data clustering via projective clustering ensembles
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...
ICALP
2004
Springer
13 years 10 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
DEXAW
2007
IEEE
135views Database» more  DEXAW 2007»
13 years 11 months ago
Unsupervised Learning of Manifolds via Linear Approximations
In this paper, we examine the application of manifold learning to the clustering problem. The method used is Locality Preserving Projections (LPP), which is chosen because of its ...
Hassan A. Kingravi, M. Emre Celebi, Pragya P. Raja...
AINA
2007
IEEE
13 years 11 months ago
Privacy-Preserving Two-Party K-Means Clustering via Secure Approximation
Chunhua Su, Feng Bao, Jianying Zhou, Tsuyoshi Taka...