Semi-supervised k-means clustering via DC programming approach
DOI10.1007/978-3-031-35305-5_4zbMATH Open1528.90196OpenAlexW4381956187MaRDI QIDQ6134046FDOQ6134046
Tatiana V. Gruzdeva, Anton Vladimirovich Ushakov
Publication date: 21 August 2023
Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-35305-5_4
Recommendations
- A \(k\)-means clustering framework based on semi-supervised learning
- Semi-supervised k-means++
- Semi-supervised algorithms for approximately optimal and accurate clustering
- Semi-supervised clustering
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Semi-supervised clustering based on affinity propagation algorithm
- A class of semi-supervised support vector machines by DC programming
local searchDC programmingconstrained clusteringsemi-supervised clusteringk-meansminimum-sum-of-squares clusteringcannot-linkmust-link
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)
Cites Work
- DILS: constrained clustering through dual iterative local search
- NP-hardness of Euclidean sum-of-squares clustering
- Optimization problems for machine learning: a survey
- 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
- The planar \(k\)-means problem is NP-hard
- Introduction to global optimization.
- An improved column generation algorithm for minimum sum-of-squares clustering
- An effective heuristic for large-scale capacitated facility location problems
- Title not available (Why is that?)
- Solving capacitated clustering problems
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- Constrained Clustering
- The capacitated centred clustering problem
- Constrained Clustering Using Column Generation
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- A matheuristic for large-scale capacitated clustering
- K-means clustering via a nonconvex optimization approach
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
- An exact algorithm for semi-supervised minimum sum-of-squares clustering
Cited In (1)
This page was built for publication: Semi-supervised \(k\)-means clustering via DC programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134046)
