The complexity of the \texttt{k-means} method
From MaRDI portal
Publication:4606353
Recommendations
Cited in
(7)- Complexity of single-swap heuristics for metric facility location and related problems
- An LP-based k-means algorithm for balancing weighted point sets
- Time complexity of rough clustering: GAs versus K-means
- Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
- \(k\)-means requires exponentially many iterations even in the plane
- k-means requires exponentially many iterations even in the plane
- Complexity of local search for Euclidean clustering problems
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)