Search Results for author:
Found 2 papers, 0 papers with code
Probably certifiably correct k-means clustering
First, we prove that Peng and Wei's semidefinite relaxation of k-means is tight with high probability under a distribution of planted clusters called the stochastic ball model.
On the tightness of an SDP relaxation of k-means
Recently, Awasthi et al. introduced an SDP relaxation of the $k$-means problem in $\mathbb R^m$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
