A Tight Lower Bound Instance for k-means++ in Constant Dimension

DOI10.1007/978-3-319-06089-7_2zbMath1407.68541arXiv1401.2912OpenAlexW1644149629MaRDI QIDQ5410631

Nir Ailon, Ragesh Jaiswal, Anup Bhattacharya

Publication date: 16 April 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.2912

zbMATH Keywords

clustering\(k\)-means\(k\)-means++

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

This page was built for publication: A Tight Lower Bound Instance for k-means++ in Constant Dimension