PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 26, 2026Mathematics0 citationsOpen Access

Hierarchical Multi-View Representation Learning via Generalized Deep Non-Negative Matrix Factorization

View Full Paper
HTHubo TanYWYuan WanGLGuoqing Luo

Key Points

  • This research aims to improve multi-view representation learning through a generalized deep non-negative matrix factorization approach.
  • Proposes GDNMF-MRL to jointly decompose feature and basis matrices for hierarchical representations.
  • Develops OS-GDNMF-MRL to learn latent representations and clustering assignments in a unified framework.
  • Implements two alternating optimization algorithms with guaranteed convergence.
  • The proposed methods outperform state-of-the-art multi-view clustering techniques in various benchmark datasets.

Abstract

Multi-view clustering aims to exploit complementary information from multiple views to uncover intrinsic grouping structures in data, where effective representation learning plays a critical role. Non-negative matrix factorization (NMF) has been widely used for multi-view representation learning due to its inherent interpretability; however, most existing NMF-based methods rely on shallow architectures and are therefore insufficient for capturing hierarchical characteristics. Although recent deep NMF models introduce multi-layer structures by factorizing either feature matrices or basis matrices, their performance may degrade when the data are limited or exhibit relatively simple structures. To address these issues, this paper proposes a generalized deep non-negative matrix factorization framework for multi-view representation learning, termed GDNMF-MRL, which jointly decomposes feature and basis matrices to learn hierarchical representations. By integrating shallow linear components with deep nonlinear structures, the proposed method enhances representation capability and yields more discriminative latent subspaces. Furthermore, a one-step variant, termed OS-GDNMF-MRL, is developed to simultaneously learn latent representations and clustering assignments within a unified optimization framework, enabling direct interaction between representation learning and clustering without requiring separate post-processing. Two efficient alternating optimization algorithms with guaranteed convergence of the objective function are derived, and extensive experiments on benchmark datasets demonstrate that the proposed methods consistently outperform several state-of-the-art multi-view clustering approaches.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Tan et al. (2026) studied this question.

synapsesocial.com/papers/69edabdf4a46254e215b3a99https://doi.org/10.3390/math14091442
Ask AI
Helpful
Bookmark
Share
View Full Paper