The following pages link to (Q5701392):
Displaying 18 items.
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- On the quality of \(k\)-means clustering based on grouped data (Q840740) (← links)
- An empirical comparison of two approaches for CDPCA in high-dimensional data (Q2062344) (← links)
- K-bMOM: A robust Lloyd-type clustering algorithm based on bootstrap median-of-means (Q2072412) (← links)
- \(K\)-means cloning: adaptive spherical \(K\)-means clustering (Q2283822) (← links)
- A doubly nonnegative relaxation for modularity density maximization (Q2297659) (← links)
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146) (← links)
- Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering (Q2670543) (← links)
- An exact algorithm for semi-supervised minimum sum-of-squares clustering (Q2676354) (← links)
- (Q3017024) (← links)
- Non-convex clustering via proximal alternating linearized minimization method (Q4634919) (← links)
- Improving spectral bounds for clustering problems by Lagrangian relaxation (Q4918244) (← links)
- (Q5053241) (← links)
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
- The Ratio-Cut Polytope and K-Means Clustering (Q5062119) (← links)
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)
- Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model (Q5868965) (← links)
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem (Q6166100) (← links)
