The Complexity of k-Means Clustering when Little is Known

Abstract

Full Citation:

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

Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.