12 citations · 27 across the 12 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
How to Round Subspaces: A New Spectral Clustering Algorithm
Ali Kemal Sinop
A basic problem in spectral clustering is the following. If a solution obtained from the spectral relaxation is close to an integral solution, is it possible to find this integral…
cs.CC2015
The Hardness of Approximation of Euclidean k-means
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy +1
The Euclidean -means problem is a classical problem that has been extensively studied in the theoretical computer science, machine learning and the computational geometry commun…