Analyzing Dα seeding for k-means

Étienne Bamas, Sai Ganesh Nagarajan, Ola Svensson
2/12/2026

No confident code implementation found for this paper.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

New Algorithms for the Learning-Augmented k-means Problem

82% match2026

SFESS: Score Function Estimators for k-Subset Sampling

77% match1 repo42026

Fast Algorithms for Distributed k-Clustering with Outliers

75% match2026

Faster Query Times for Fully Dynamic k-Center Clustering with Outliers

74% match2026

Geometric Median (GM) Matching for Robust k-Subset Selection from Noisy Data

74% match2026

Improved Guarantees for Fully Dynamic k-Center Clustering with Outliers in General Metric Spaces

72% match2026

Cite this paper

@article{bamas2026analyzing,
  title  = {Analyzing Dα seeding for k-means},
  author = {Étienne Bamas and Sai Ganesh Nagarajan and Ola Svensson},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:0fe51b2294e768945b6ea295f6ab1a1058e40cd7},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/0fe51b2294e768945b6ea295f6ab1a1058e40cd7.svg)](https://codeofpaper.com/paper/0fe51b2294e768945b6ea295f6ab1a1058e40cd7)

Discussion