Active Block Diagonal Subspace Clustering
Subspace clustering aims to find clusters in the low-dimensional subspaces for high-dimensional data.Subspace clustering with Block Diagonal Representation (BDR) maintains the number of connected components of the graph by Laplacian rank constraint, and the learned affinity matrix shows a block diagonal structure, which will achieve a good segmenta