Pages that link to "Item:Q897656"
From MaRDI portal
The following pages link to Recovery guarantees for exemplar-based clustering (Q897656):
Displayed 9 items.
- Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
- Probably certifiably correct \(k\)-means clustering (Q1675259) (← links)
- Clustering subgaussian mixtures by semidefinite programming (Q4603713) (← links)
- Exact Clustering of Weighted Graphs via Semidefinite Programming (Q4633040) (← links)
- Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization (Q4634103) (← links)
- Local Versions of Sum-of-Norms Clustering (Q5048022) (← links)
- Discrete facility location in machine learning (Q5100135) (← 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)