An exact algorithm for semi-supervised minimum sum-of-squares clustering
From MaRDI portal
Publication:2676354
DOI10.1016/j.cor.2022.105958OpenAlexW3217296984WikidataQ113877474 ScholiaQ113877474MaRDI QIDQ2676354
Antonio M. Sudoso, Anna Russo Russo, Veronica Piccialli
Publication date: 27 September 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.15571
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
- Geometric clustering for the consolidation of farmland and woodland
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Constrained clustering by constraint programming
- A semi-supervised fuzzy clustering algorithm applied to gene expression data
- An improved column generation algorithm for minimum sum-of-squares clustering
- Learning a Mahalanobis distance metric for data clustering and classification
- NP-hardness of Euclidean sum-of-squares clustering
- Constrained clustering via diagrams: a unified theory and its application to electoral district design
- Optimization problems for machine learning: a survey
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- A survey of kernel and spectral methods for clustering
- A scatter search approach for the minimum sum-of-squares clustering problem
- A global optimization RLT-based approach for solving the hard clustering problem
- DILS: constrained clustering through dual iterative local search
- Local search for constrained graph clustering in biological networks
- A matheuristic for large-scale capacitated clustering
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
- Introduction to Semi-Supervised Learning
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- A Branch and Bound Clustering Algorithm
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Least squares quantization in PCM
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- Evaluation of a Branch and Bound Algorithm for Clustering
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- Constrained Clustering Using Column Generation
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Cluster Analysis and Mathematical Programming
