Consistent Block Diagonal and Exclusive Multi-view Subspace Clustering

Subspace clustering method provides an effective solution to the clustering problem of high-dimensional multi-view data.Focusing on the issue that the representation matrix cannot obey the block diagonal property directly by using low rank or sparse constraints in existing algorithms,a consistent block diagonal and exclusive multi-view subspace clustering(CBDE-MSC) is proposed.CBDE-MSCdecomposes the subspace representation matrix of each perspective into consistent and specific self-representation matrices.For the consistent self-representation matrix,block diagonal constraint is used to make it have an approximate block diagonal structure and explore the consistency of the data.The exclusive constraint is applied between specific self-representation matrices to explore the complementarity of data.The matrix <i>L</i>_2,1 norm is used to constrain the error matrix so that it satisfies row sparsity.In addition,alternate direction multiplier method(ADMM) is used to optimize the objective function.CBDE-MSC is evaluated by normalized mutual information(NMI),accuracy(ACC),adjusted rand index(AR) and F-score.Expe-rimental results show that compared with some existing excellent algorithms,CBDE-MSC has a great improvement in the results of the four indicators,especially in the YaleB dataset,CBDE-MSC compared with the classical method CSMSC,NMI,ACC,AR and F-score increased by 0.088,0.127,0.145 and 0.122,which verifies the effectiveness of the proposed algorithm.