K-means clustering via a nonconvex optimization approach

DOI10.1007/978-3-030-77876-7_31zbMath1489.90135OpenAlexW3166121878MaRDI QIDQ2117651

Tatiana V. Gruzdeva, Anton Vladimirovich Ushakov

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-77876-7_31

zbMATH Keywords

local searchnonconvex optimizationDC programmingglobal search schememinimum-sum-of-squares clustering

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Related Items (1)

Semi-supervised \(k\)-means clustering via DC programming approach

Uses Software

• J-MEANS
• k-means++

Cites Work

• Unnamed Item
• Unnamed Item
• On local search in d.c. optimization problems
• On numerical solving the spherical separability problem
• The planar \(k\)-means problem is NP-hard
• An improved column generation algorithm for minimum sum-of-squares clustering
• New heuristic for harmonic means clustering
• New and efficient DCA based algorithms for minimum sum-of-squares clustering
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• NP-hardness of Euclidean sum-of-squares clustering
• A tabu search approach for the minimum sum-of-squares clustering problem
• Cluster analysis and mathematical programming
• On approximate geometric \(k\)-clustering
• A method of truncated codifferential with application to some problems of cluster analysis
• New diagonal bundle method for clustering problems in large data sets
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Near-optimal large-scale k-medoids clustering
• On a continuous approach for the maximum weighted clique problem
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
• A scatter search approach for the minimum sum-of-squares clustering problem
• A global optimization RLT-based approach for solving the hard clustering problem
• On Solving Optimization Problems with Hidden Nonconvex Structures
• Complexity of certain problems of searching for subsets of vectors and cluster analysis
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• A local search approximation algorithm for k-means clustering
• Integer Programming and the Theory of Grouping
• Evaluation of a Branch and Bound Algorithm for Clustering
• The effectiveness of lloyd-type methods for the k-means problem
• J-MEANS: A new local search heuristic for minimum sum of squares clustering

This page was built for publication: K-means clustering via a nonconvex optimization approach