The Ratio-Cut Polytope and K-Means Clustering

Computational study of separation algorithms for clique inequalities

(2019) Francesca Marzi et al.   SOFT COMPUTING

Certifying Global Optimality of Graph Cuts via Semidefinite Relaxation: A Performance Guarantee for Spectral Clustering

(2019) Shuyang Ling et al.   FOUNDATIONS OF COMPUTATIONAL MATHEMATICS

When do birds of a feather flock together? k-Means, proximity, and conic programming

(2018) Xiaodong Li et al.   MATHEMATICAL PROGRAMMING

Random Laplacian Matrices and Convex Relaxations

(2016) Afonso S. Bandeira   FOUNDATIONS OF COMPUTATIONAL MATHEMATICS

Achieving Exact Cluster Recovery Threshold via Semidefinite Programming

(2016) Bruce Hajek et al.   IEEE TRANSACTIONS ON INFORMATION THEORY

Exact Recovery in the Stochastic Block Model

(2016) Emmanuel Abbe et al.   IEEE TRANSACTIONS ON INFORMATION THEORY

Probably certifiably correct k-means clustering

(2016) Takayuki Iguchi et al.   MATHEMATICAL PROGRAMMING