Metraipolis › archive › dc_0dd3db7d774d

Dimension Reduction and Coresets for Min-Sum $k$-Clustering — arXiv:2610.38920

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.38920
License (as archived)
CC0-1.0
Archived
2026-11-01T02:47:44.903Z
SHA-256 of the archived text
95a325d183c802b6989acc8020f176c463f3289a60731ab72c83954e024cb9a8
Stable URL of this page
https://metraipolis.com/documento/dc_0dd3db7d774d

How to cite

Dimension Reduction and Coresets for Min-Sum $k$-Clustering — arXiv:2610.38920 — arXiv (en), https://arxiv.org/abs/2610.38920 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0dd3db7d774d (Metraipolis archive dc_0dd3db7d774d, sha256 95a325d183c802b6989acc8020f176c463f3289a60731ab72c83954e024cb9a8)
BibTeX
@misc{dc0dd3db7d774d,
  title = {Dimension Reduction and Coresets for Min-Sum $k$-Clustering — arXiv:2610.38920},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.38920},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0dd3db7d774d; sha256 95a325d183c802b6989acc8020f176c463f3289a60731ab72c83954e024cb9a8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38920. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The min-sum $k$-clustering problem asks to partition an input of $n$ points into $k$ clusters so as to minimize the total pairwise distance within clusters. It is a natural alternative to center-based objectives when the data is not well captured by a small set of representative points. We study for this problem two standard sketching methods, dimension reduction and coresets, which represent the input more compactly while preserving the min-sum cost of every $k$-partition up to $1\pm\varepsilon$ factor. Our first contribution addresses dimension reduction in Euclidean space. The Johnson-Lindenstrauss (JL) Lemma readily implies that a random linear map to target dimension $t=O(\varepsilon^{-2}\log n)$ preserves, with high probability, the min-sum cost of all $k$-partitions. We show that target dimension $t=O(\varepsilon^{-2}(ddim\cdot\log(1/\varepsilon)+\log k+\log\log n))$ suffices for Euclidean inputs of doubling dimension at most $ddim$, and moreover this bound is nearly optimal. We also show that target dimension $t=O(\varepsilon^{-2}(\log(1/\varepsilon)+\log k+\log\Delta))$ suffices for Euclidean inputs of aspect ratio at most $\Delta$. Our second contribution is to design the first $\varepsilon$-coreset for metric min-sum $k$-clustering. It is actually a movement-based coreset, has size $(1/\varepsilon)^{O(ddim)} k\log n$ for inputs of doubling dimension at most $ddim$, and can be constructed in randomized near-linear-time. We further use these coresets to design streaming algorithms for the problem.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computational Geometry (cs.CG).
Pagina del lavoro: https://arxiv.org/abs/2610.38920 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:17:58.595Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).