Interpretation and optimization of the k-means algorithm.

DOI10.1007/S10492-014-0063-5zbMATH Open1340.68112OpenAlexW1992718985MaRDI QIDQ464720FDOQ464720

Authors: Rudolf Scitovski, Kristian Sabo 

Publication date: 29 October 2014

Published in: Applications of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10492-014-0063-5

Recommendations

• \(k\)-means algorithm
• An efficient enhanced \(k\)-means clustering algorithm
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• -Means: A new generalized k-means clustering algorithm
• A survey on algorithms for \(k\)-means problem and its variants

zbMATH Keywords

clustering\(k\)-meansVoronoi diagram

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Cites Work

• A toolbox for \(K\)-centroids cluster analysis
• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
• Firefly Algorithms for Multimodal Optimization
• Lipschitzian optimization without the Lipschitz constant
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• Title not available (Why is that?)
• On fuzzy cluster validity indices
• A generalized Weiszfeld method for the multi-facility location problem
• Introduction to clustering large and high-dimensional data.
• Title not available (Why is that?)
• A review of recent advances in global optimization
• Title not available (Why is that?)
• Data Clustering: Theory, Algorithms, and Applications
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• One-dimensional center-based l 1-clustering method
• Building initial partitions through sampling techniques
• Title not available (Why is that?)
• Fast modified global \(k\)-means algorithm for incremental cluster construction

Cited In (7)

• \(k\)-means algorithm
• Optimising \(k\)-means clustering results with standard software packages
• A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
• Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification
• Improved \(k'\)-means algorithms and applications in image segmentation
• The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm.
• Title not available (Why is that?)

Uses Software

• LGO
• DIRECT
• flexclust
• SymDIRECT

This page was built for publication: Interpretation and optimization of the \(k\)-means algorithm.

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