Convex Subspace Clustering by Adaptive Block Diagonal Representation
Yunxia Lin, Songcan Chen

TL;DR
This paper introduces ABDR, a convex subspace clustering method that adaptively enforces block diagonal structure in the representation matrix, improving robustness and accuracy over existing approaches.
Contribution
It proposes a novel convex regularizer inspired by Convex BiClustering to explicitly and adaptively achieve block diagonal structure in subspace clustering.
Findings
ABDR outperforms state-of-the-art methods on synthetic data.
ABDR demonstrates superior performance on real benchmark datasets.
The method effectively determines the number of clusters adaptively.
Abstract
Subspace clustering is a class of extensively studied clustering methods where the spectral-type approaches are its important subclass. Its key first step is to desire learning a representation coefficient matrix with block diagonal structure. To realize this step, many methods were successively proposed by imposing different structure priors on the coefficient matrix. These impositions can be roughly divided into two categories, i.e., indirect and direct. The former introduces the priors such as sparsity and low rankness to indirectly or implicitly learn the block diagonal structure. However, the desired block diagonalty cannot necessarily be guaranteed for noisy data. While the latter directly or explicitly imposes the block diagonal structure prior such as block diagonal representation (BDR) to ensure so-desired block diagonalty even if the data is noisy but at the expense of losing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
