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

Full description

Bibliographic Details
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