Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case

DOI10.1007/978-3-030-40616-5_35OpenAlexW3005703968MaRDI QIDQ5122317

Vladimir Khandeev, Alexander Kel'Manov

Publication date: 22 September 2020

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

Full work available at URL: https://doi.org/10.1007/978-3-030-40616-5_35

zbMATH Keywords

linear-time algorithmparameterized approachone-dimensional case\(K\)-Means

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

• The planar \(k\)-means problem is NP-hard
• NP-hardness of Euclidean sum-of-squares clustering
• Optimal quantization by matrix searching
• Cluster Analysis and Mathematical Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case