文件名称：Clusteringhigh-dimensional data via spectral clustering using collaborative representationcoefficients
文件大小：697KB
文件格式：PDF
更新时间：2024-02-28 12:31:34
Affinity matrix; k-nearest neighbor; Sparse
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