26 citations · 48 across the 5 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2015
Probably certifiably correct k-means clustering
Takayuki Iguchi, Dustin G. Mixon, Jesse Peterson +1
Recently, Bandeira [arXiv:1509.00824] introduced a new type of algorithm (the so-called probably certifiably correct algorithm) that combines fast solvers with the optimality certi…
cs.IT2015★ 21 cited
On the tightness of an SDP relaxation of k-means
Takayuki Iguchi, Dustin G. Mixon, Jesse Peterson +1
Recently, Awasthi et al. introduced an SDP relaxation of the -means problem in . In this work, we consider a random model for the data points in which balls of…