Global optimality in \(k\)-means clustering

DOI10.1016/j.ins.2018.02.001zbMath1440.68240MaRDI QIDQ2195470

Domingo Gómez-Pérez, Cristina Tîrnăucă, José L. Balcázar, José Luis Montaña

Publication date: 8 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.02.001

zbMATH Keywords

clustering; Voronoi diagrams; cell arrangement

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

68W40: Analysis of algorithms

68T05: Learning and adaptive systems in artificial intelligence

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Mixed-integer programming techniques for the minimum sum-of-squares clustering problem, A new robust fuzzy clustering validity index for imbalanced data sets, Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast global \(k\)-means clustering based on local geometrical information
• An approach to cluster separability in a partition
• A local search approximation algorithm for \(k\)-means clustering
• Clustering large graphs via the singular value decomposition
• NP-hardness of Euclidean sum-of-squares clustering
• Improved Algorithms for Sign Determination and Existential Quantifier Elimination
• The Planar k-Means Problem is NP-Hard
• Least squares quantization in PCM
• The effectiveness of lloyd-type methods for the k-means problem
• A Dynamic Programming Algorithm for Cluster Analysis
• Finding at least one point in each connected component of a real algebraic set defined by a single equation