<span xss=removed>Recently, subspace clustering has achieved promising clustering quality by performing spectral clustering over an affinity graph. It is a key to construct a robust affinity matrix in graph-oriented subspace clustering. Sparse representation can represent each object as a sparse linear combination of other objects and has been used to cluster high-dimensional data. However, all the
