Active Block Diagonal Subspace Clustering

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 dia...

Full description

Bibliographic Details
Main Authors: Ziqi Xie, Lihong Wang
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Active learning
subspace clustering
block diagonal representation
pairwise constraints
self-expressiveness
convergence
Online Access:https://ieeexplore.ieee.org/document/9448219/

Internet

https://ieeexplore.ieee.org/document/9448219/

Similar Items