Low-Rank Sparse Subspace for Spectral Clustering

Traditional graph clustering methods consist of two sequential steps, i.e., constructing an affinity matrix from the original data and then performing spectral clustering on the resulting affinity ...