The Complexity of k-Means Clustering when Little is Known

Ganian, Robert; Hamm, Thekla; Korchemna, Viktoriia; Okrasa, Karolina; Simonov, Kirill

by Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov

Reference:

The Complexity of k-Means Clustering when Little is KnownRobert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill SimonovInternational Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA (Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu, Sivan Sabato, eds.), volume 162 of Proceedings of Machine Learning Research, pages 6960–6987, 2022, PMLR.

Bibtex Entry:

@inproceedings{GanianHKOS22icml,
  author    = {Robert Ganian and
               Thekla Hamm and
               Viktoriia Korchemna and
               Karolina Okrasa and
               Kirill Simonov},
  editor    = {Kamalika Chaudhuri and
               Stefanie Jegelka and
               Le Song and
               Csaba Szepesv{\'{a}}ri and
               Gang Niu and
               Sivan Sabato},
  title     = {The Complexity of k-Means Clustering when Little is Known},
  booktitle = {International Conference on Machine Learning, {ICML} 2022, 17-23 July
               2022, Baltimore, Maryland, {USA}},
  series    = {Proceedings of Machine Learning Research},
  volume    = {162},
  pages     = {6960--6987},
  publisher = {{PMLR}},
  year      = {2022},
  url       = {https://proceedings.mlr.press/v162/ganian22a.html},
  keywords = {nfpc,ParAI}
}