A black-box reduction turns any vanilla clustering coreset into an epsilon-coreset for clustering with m outliers, with size N times polylog plus min{O(km/epsilon), O(m/epsilon^{2z})}.
Distributed k-means and k-median clustering on general communication topologies
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Coresets for Robust Clustering via Black-box Reductions to Vanilla Case
A black-box reduction turns any vanilla clustering coreset into an epsilon-coreset for clustering with m outliers, with size N times polylog plus min{O(km/epsilon), O(m/epsilon^{2z})}.