Mixed integer linear programming formulation for K-means clustering problem
From MaRDI portal
Publication:6536475
DOI10.1007/s10100-023-00881-1MaRDI QIDQ6536475
Kolos Cs. Ágoston, Marianna. E.-Nagy
Publication date: 13 May 2024
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Cites Work
- Algorithm AS 136: A K-Means Clustering Algorithm
- Integer programming models for the \(q\)-mode problem
- NP-hardness of Euclidean sum-of-squares clustering
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Cluster analysis and mathematical programming
- NP-hardness of \(m\)-dimensional weighted matching problems
- Numerical methods for fuzzy clustering
- Relax, No Need to Round
- A Canonical Representation of Simple Plant Location Problems and Its Applications
- Finding Groups in Data
- Fast Clustering Algorithms
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- Integer Programming and the Theory of Grouping
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Cluster Analysis and Mathematical Programming
Related Items (1)
This page was built for publication: Mixed integer linear programming formulation for K-means clustering problem
