Subspace Clustering with Block Diagonal Sparse Representation
Abstract Structured representation is of remarkable significance in subspace clustering. However, most of the existing subspace clustering algorithms resort to single-structured representation, which may fail to fully capture the essential characteristics of data. To address this issu...
Main Authors: | Fang, Xian, Zhang, Ruixun, Li, Zhengxin, Shao, Xiuli |
---|---|
Other Authors: | Sloan School of Management. Laboratory for Financial Engineering |
Format: | Article |
Language: | English |
Published: |
Springer US
2021
|
Online Access: | https://hdl.handle.net/1721.1/136958 |
Similar Items
-
A theory of quantum subspace diagonalization
by: Epperly, EN, et al.
Published: (2022) -
Enhanced subspace clustering
by: Sim, Kelvin Sian Hui.
Published: (2012) -
Block-diagonal solutions to Lyapunov inequalities and generalisations of diagonal dominance
by: Sootla, A, et al.
Published: (2018) -
Cluster Evaluation of Density Based Subspace Clustering
by: Sembiring, Rahmat Widia, et al.
Published: (2010) -
Dense for the price of sparse: improved performance of sparsely initialized networks via a subspace offset
by: Price, I, et al.
Published: (2021)