Towards optimal lower bounds for k-median and k-means coresets-Reference-Cited by-同舟云学术

Towards optimal lower bounds for k-median and k-means coresets

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Cohen-Addad Vincent¹,Larsen Kasper Green²,Saulpic David³,Schwiegelshohn Chris²

Affiliation:

1. Google Research, Switzerland

2. Aarhus University, Denmark

3. Sorbonne University, France

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3519946

Reference84 articles.

1. Approximating extent measures of points

2. Pankaj K Agarwal , Sariel Har-Peled , and Kasturi R Varadarajan . 2005. Geometric approximation via coresets. Combinatorial and computational geometry, 52 ( 2005 ), 1–30. Pankaj K Agarwal, Sariel Har-Peled, and Kasturi R Varadarajan. 2005. Geometric approximation via coresets. Combinatorial and computational geometry, 52 (2005), 1–30.

3. Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms

4. Olivier Bachem , Mario Lucic , and Silvio Lattanzi . 2018 . One-shot Coresets: The Case of k-Clustering . In International Conference on Artificial Intelligence and Statistics, AISTATS 2018 , 9-11 April 2018, Playa Blanca, Lanzarote, Canary Islands, Spain, Amos J. Storkey and Fernando Pérez-Cruz (Eds.) (Proceedings of Machine Learning Research , Vol. 84). PMLR, 784– 792 . http://proceedings.mlr.press/v84/bachem18a.html Olivier Bachem, Mario Lucic, and Silvio Lattanzi. 2018. One-shot Coresets: The Case of k-Clustering. In International Conference on Artificial Intelligence and Statistics, AISTATS 2018, 9-11 April 2018, Playa Blanca, Lanzarote, Canary Islands, Spain, Amos J. Storkey and Fernando Pérez-Cruz (Eds.) (Proceedings of Machine Learning Research, Vol. 84). PMLR, 784–792. http://proceedings.mlr.press/v84/bachem18a.html

5. Daniel Baker , Vladimir Braverman , Lingxiao Huang , Shaofeng H.-C. Jiang , Robert Krauthgamer , and Xuan Wu . 2020 . Coresets for Clustering in Graphs of Bounded Treewidth . In Proceedings of the 37th International Conference on Machine Learning, ICML 2020 , 13-18 July 2020, Virtual Event (Proceedings of Machine Learning Research , Vol. 119). PMLR, 569– 579 . http://proceedings.mlr.press/v119/baker20a.html Daniel Baker, Vladimir Braverman, Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, and Xuan Wu. 2020. Coresets for Clustering in Graphs of Bounded Treewidth. In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event (Proceedings of Machine Learning Research, Vol. 119). PMLR, 569–579. http://proceedings.mlr.press/v119/baker20a.html

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. MapReduce algorithms for robust center-based clustering in doubling metrics;Journal of Parallel and Distributed Computing;2024-12

2. On Optimal Coreset Construction for Euclidean (k,z)-Clustering;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. On coresets for fair clustering in metric and Euclidean spaces and their applications;Journal of Computer and System Sciences;2024-06

4. Settling Time vs. Accuracy Tradeoffs for Clustering Big Data;Proceedings of the ACM on Management of Data;2024-05-29

5. Speeding up k-means clustering in high dimensions by pruning unnecessary distance computations;Knowledge-Based Systems;2024-01