Pages that link to "Item:Q1675259"
From MaRDI portal
The following pages link to Probably certifiably correct \(k\)-means clustering (Q1675259):
Displayed 14 items.
- On the minimum of the mean-squared error in 2-means clustering (Q1624878) (← links)
- Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018 (Q1731982) (← links)
- Convex relaxation methods for community detection (Q2038282) (← links)
- Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering (Q2189394) (← links)
- When do birds of a feather flock together? \(k\)-means, proximity, and conic programming (Q2288194) (← links)
- Certifiably optimal sparse principal component analysis (Q2293653) (← links)
- Efficient, certifiably optimal clustering with applications to latent variable graphical models (Q2425167) (← links)
- Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization (Q4634103) (← links)
- Non-convex clustering via proximal alternating linearized minimization method (Q4634919) (← links)
- A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix (Q4994436) (← 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)
- \(k\)-median: exact recovery in the extended stochastic ball model (Q6044983) (← links)