Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal

DOI10.1145/3357713.3384296OpenAlexW3035569828MaRDI QIDQ5145024

Lingxiao Huang, Nisheeth K. Vishnoi

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.06263

zbMATH Keywords

importance samplingclusteringdimension reduction\(k\)-means\(k\)-mediancoresets

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

On coresets for fair clustering in metric and Euclidean spaces and their applications

This page was built for publication: Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal