Strong Coresets for k-Median and Subspace Approximation: Goodbye Dimension
Authors:
- Christian SohlerCSChristian Sohler
- David P. WoodruffDWDavid P. Woodruff
- 1 October 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 802-813
Abstract
We obtain the first strong coresets for the k-median and subspace approximation problems with sum of distances objective function, on n points in d dimensions, with a number of weighted points that is independent of both n and d; namely, our coresets have size poly(k/ε). A strong coreset (1+ε)-approximates the cost function for all possible sets of centers simultaneously. We also give efficient nnz(A) + (n+d) poly(k/ε) + exp(poly(k/ε)) time algorithms for computing these coresets. We obtain the result by introducing a new dimensionality reduction technique for coresets that significantly generalizes an earlier result of Feldman, Sohler and Schmidt [FSS13] for squared Euclidean distances to sums of P-th powers of Euclidean distances for constant p≥1.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Dimensionality Reduction for k-Means Clustering and Low Rank Approximation2015
- L p Row Sampling by Lewis Weights2015
- Randomized Dimensionality Reduction for $k$ -Means ClusteringIEEE Transactions on Information Theory, 2014
- Low rank approximation and regression in input sparsity time2013
- Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering2013
- Data reduction for weighted and outlier-resistant clustering2012
- Universal ε-approximators for integrals2010
- Coresets and Sketches for High Dimensional Subspace Approximation Problems2010
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their ApplicationsSIAM Journal on Computing, 2009
- Smaller Coresets for k-Median and k-Means ClusteringDiscrete & Computational Geometry, 2006