Structured representation is of remarkable significance in subspace clustering. However, most the existing clustering algorithms resort to single-structured representation, which may fail fully capture essential characteristics data. To address this issue, a novel multi-structured algorithm called block diagonal sparse (BDSR) proposed paper. It takes both and structured representations into acc...