K-means clustering via a nonconvex optimization approach
From MaRDI portal
Publication:2117651
DOI10.1007/978-3-030-77876-7_31zbMATH Open1489.90135OpenAlexW3166121878MaRDI QIDQ2117651FDOQ2117651
Authors: 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
Recommendations
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Non-convex clustering via proximal alternating linearized minimization method
nonconvex optimizationlocal searchDC programmingglobal search schememinimum-sum-of-squares clustering
Cites Work
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Title not available (Why is that?)
- NP-hardness of Euclidean sum-of-squares clustering
- The effectiveness of Lloyd-type methods for the \(k\)-means problem
- Cluster analysis and mathematical programming
- On local search in d.c. optimization problems
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- On solving optimization problems with hidden nonconvex structures
- On numerical solving the spherical separability problem
- The planar \(k\)-means problem is NP-hard
- Integer Programming and the Theory of Grouping
- An improved column generation algorithm for minimum sum-of-squares clustering
- Title not available (Why is that?)
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- On a continuous approach for the maximum weighted clique problem
- A scatter search approach for the minimum sum-of-squares clustering problem
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- A global optimization RLT-based approach for solving the hard clustering problem
- On approximate geometric \(k\)-clustering
- A local search approximation algorithm for \(k\)-means clustering
- Near-optimal large-scale k-medoids clustering
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- A method of truncated codifferential with application to some problems of cluster analysis
- Complexity of certain problems of searching for subsets of vectors and cluster analysis
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- New heuristic for harmonic means clustering
- A tabu search approach for the minimum sum-of-squares clustering problem
- Evaluation of a Branch and Bound Algorithm for Clustering
- New diagonal bundle method for clustering problems in large data sets
Cited In (17)
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Optimizing MSE for clustering with balanced size constraints
- Spherical k-Means++ Clustering
- A global optimization RLT-based approach for solving the hard clustering problem
- Mechanism and a new algorithm for nonconvex clustering
- Self-learning \(K\)-means clustering: a global optimization approach
- Improved Conic Reformulations for $K$-means Clustering
- Semi-supervised \(k\)-means clustering via DC programming approach
- A DC optimization approach for constrained clustering with \(\ell_1\)-norm
- A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization
- Title not available (Why is that?)
- Minimizing differences of convex functions with applications to facility location and clustering
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
- Non-convex clustering via proximal alternating linearized minimization method
- Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
- A generalized \(k\)-means problem for clustering and an ADMM-based \(k\)-means algorithm
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
Uses Software
This page was built for publication: K-means clustering via a nonconvex optimization approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117651)
