Spectral clusteringwith K-means
Purdue University
Purdue University
Instead of two overlapping clusters,we find three clusters.
Purdue University
Instead of clustering the rows of the singular vectors, find the minimum 0- norm vector in the space spanned by the singular vectors.
The minimum 0-norm vector is, of course, the all zero vector, so we will require one component to be 1.
Purdue University
Finding the minimum 0-norm vector is NP-hard.
Use the minimum 1-norm vector as a proxy. This is a linear programming problem.
Purdue University