A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering

DOI10.1007/978-3-030-91059-4_6zbMath1520.62088MaRDI QIDQ6488346

Tatiana V. Gruzdeva, Anton Vladimirovich Ushakov

Publication date: 13 April 2023

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)

Related Items (1)

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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Algorithm AS 136: A K-Means Clustering Algorithm
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 method of truncated codifferential with application to some problems of cluster analysis
The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
A heuristic algorithm for solving the minimum sum-of-squares clustering problems
Near-optimal large-scale k-medoids clustering
K-means clustering via a nonconvex optimization approach
On a continuous approach for the maximum weighted clique problem
Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
On solving the sum-of-ratios problem
On Solving Optimization Problems with Hidden Nonconvex Structures
K-MEANS CLUSTERING USING ENTROPY MINIMIZATION
A Branch and Bound Clustering Algorithm
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
Least squares quantization in PCM
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: A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering