arrow
Return

Tensorized multi-dimensional multi-view clustering based on nonnegative matrix factorization

delete2026-01-21
delete0
PRE
AI
Y
Yuanzhuo Zhang
DOI:10.1016/j.neunet.2025.108507delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
With the growing availability of multi-view data, numerous multi-view clustering (MVC) algorithms have been developed to effectively group samples across different views. Although existing methods have achieved notable progress, most still suffer from several limitations. (1) A majority of approaches are constrained by the computational and storage overhead of affinity matrix construction, which prevents them from scaling to large datasets. (2) Although nonnegative matrix factorization (NMF) methods perform well on large-scale data, they usually assume a dimension-fixed shared coefficient matrix across all views along with view-specific basis matrices, which constrains the model's performance. (3) Matrix-based approaches are also prone to noise and feature redundancy when handling high-dimensional data, leading to reduced robustness and clustering accuracy. To solve these problems, we propose a novel tensorized multi-dimensional multi-view clustering based on nonnegative matrix factorization (TMMVC). Specifically, we first adopt NMF to map each view into embedding spaces of different dimensionalities, thereby obtaining their respective basis matrices, thereby capturing the structural information specific to each view more comprehensively. Subsequently, the coefficient matrices learned from these basis matrices are mapped into a shared k-dimensional subspace through view-specific rotation matrices, enabling effective alignment and fusion into a unified consensus representation. This operation significantly reduces computational overhead, then the fused representation matrix is then stacked together with the previously obtained feature mapping to form a third-order tensor, upon which a tensor Schatten-p norm regularization is imposed to capture the underlying global structure and enhance clustering accuracy and robustness. We employ the Augmented Lagrange Multiplier (ALM) method to solve the optimization problem. Experimental results on several public benchmark datasets demonstrate that TMMVC method consistently outperforms state-of-the-art MVC algorithms in terms of clustering accuracy and scalability.
Keywords:
Nonnegative matrix factorization
Multi-view clustering
Multi-dimensional

Journal

Neural Networks cover
Neural Networks
IF:
6.3
Papers:
7.8K
Citations:
3.0W

Organization

A
anhui polytechnic university
Scholars:
1.5K
Papers: 465
Citations: 0
Cited Papers

Cited Papers

Unsupervised Learning Methods for Molecular Simulation Data
err2021-05-04
err0
errOAAI
errAldo Glielmo; Brooke E. Husic; Alex Rodriguez; Cecilia Clementi; Frank Noé; Alessandro Laio
errShare
errSave
Incomplete Multi-View Clustering via Mutual Information
err2025-01-01
err0
PREAI
errYu,Xuejiao; Chao,Guoqing; Jiang,Yi; Ke,Guanzhou; Chu,Dianhui
errShare
errSave
Latent Low-Rank Representation With Weighted Distance Penalty for Clustering
err2023-11-01
err15
PREAI
errFu, Zhiqiang; Zhao, Yao; Chang, Dongxia; Wang, Yiming; Wen, Jie
errShare
errSave
Multi-view clustering via multi-manifold regularized non-negative matrix factorization
err2017-04-01
err220
errOAAI
errZong, Linlin; Zhang, Xianchao; Zhao, Long; Yu, Hong; Zhao, Qianli
errShare
errSave
Fast Parameter-Free Multi-View Subspace Clustering With Consensus Anchor Guidance
err2022-01-01
err219
PREAI
errWang, Siwei; Liu, Xinwang; Zhu, Xinzhong; Zhang, Pei; Zhang, Yi; Gao, Feng; Zhu, En
errShare
errSave
Scalable and Structural Multi-View Graph Clustering With Adaptive Anchor Fusion
err2024-01-01
err3
PREAI
errWang, Siwei; Liu, Xinwang; Liu, Suyuan; Tu, Wenxuan; Zhu, En
errShare
errSave
errShare
errSave
Deep embedded multi-view clustering with collaborative training
err2021-09-01
err0
errOAAI
errJie Xu; Yazhou Ren; Guofeng Li; Lili Pan; Ce Zhu; Zenglin Xu
errShare
errSave
researcher View more