mlsanityData to 7 Oct 2026

One-Shot Coresets: The Case of k-Clustering

arXiv 1711.09649 ↗First posted 27 Nov 2017stat.ML cs.LGcited by 15

Not on the map. Why?

Abstract (arXiv)

Scaling clustering algorithms to massive data sets is a challenging task. Recently, several successful approaches based on data summarization methods, such as coresets and sketches, were proposed. While these techniques provide provably good and small summaries, they are inherently problem dependent - the practitioner has to commit to a fixed clustering objective before even exploring the data. However, can one construct small data summaries for a wide range of clustering problems simultaneously? In this work, we affirmatively answer this question by proposing an efficient algorithm that constructs such one-shot summaries for k-clustering problems while retaining strong theoretical guarantees.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Nov 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 6; 2023: 5; 2024: 1; 2025: 0; 2026: 2.

15 papers.

Sort: