Dual-Tensor Constrained Multi-View Subspace Clustering

Existing multi-view clustering approaches based on matrix factorization often fail to jointly capture global high-order correlations and local view-specific characteristics, and they typically suffer from instability in generating final clustering labels. To overcome these limitations, this paper presents a multi-view subspace clustering method termed dual-tensor constrained multi-view subspace clustering (DTCMVSC). Specifically, for each view, we learn an independent latent representation matrix, a projection matrix, and a basis matrix. The latent representations and projection matrices are stacked into third-order tensors, upon which tensor nuclear norm regularization is imposed to simultaneously exploit consensus structures and complementary information across views. Additionally, a consensus regularization term and adaptive view weights are introduced to align the latent representations of different views toward a unified consensus subspace. The resulting optimization problem is efficiently solved under the ADMM framework, after which a similarity matrix is constructed from the consensus representation and spectral clustering is performed to obtain the final labels. Experimental evaluations on six benchmark datasets demonstrate the superiority of DTCMVSC. Specifically, it achieves an ACC of 86.10% on CMU and an NMI of 94.17% on ORL, surpassing even the lowest-performing state-of-the-art baselines by 63.08 and 18.53 percentage points, respectively.