1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LG2022
Sketch-and-solve approaches to k-means clustering by semidefinite programming
Charles Clum, Dustin G. Mixon, Soledad Villar +1
We introduce a sketch-and-solve approach to speed up the Peng-Wei semidefinite relaxation of k-means clustering. When the data is appropriately separated we identify the k-means op…
cs.IT2020★ 1 cited
Sketching semidefinite programs for faster clustering
Dustin G. Mixon, Kaiying Xie
Many clustering problems enjoy solutions by semidefinite programming. Theoretical results in this vein frequently consider data with a planted clustering and a notion of signal str…