The complexity of the \texttt{k-means} method

DOI10.4230/LIPICS.ESA.2016.78zbMATH Open1397.68108OpenAlexW2539040520MaRDI QIDQ4606353FDOQ4606353

Joshua R. Wang, Tim Roughgarden

Publication date: 2 March 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2016.78

Recommendations

• \(k\)-means requires exponentially many iterations even in the plane
• \(k\)-means requires exponentially many iterations even in the plane
• Smoothed analysis of the \(k\)-means method
• How fast is the \(k\)-means method?
• How fast is the \(k\)-means method?

zbMATH Keywords

\(k\)-meansPSPACE-complete

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (4)

• Complexity of single-swap heuristics for metric facility location and related problems
• Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
• Title not available (Why is that?)
• An LP-based \(k\)-means algorithm for balancing weighted point sets

This page was built for publication: The complexity of the \texttt{k-means} method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606353)