Multi-View Factorizing and Disentangling: A Novel Framework for Incomplete Multi-View Multi-Label Classification

• URL: http://arxiv.org/abs/2501.06524v2
• Date: Sat, 25 Jan 2025 08:54:18 GMT
• Title: Multi-View Factorizing and Disentangling: A Novel Framework for Incomplete Multi-View Multi-Label Classification
• Authors: Wulin Xie, Lian Zhao, Jiang Long, Xiaohuan Lu, Bingyan Nie,
• Abstract summary: We propose a novel framework for incomplete multi-view multi-label classification (iMvMLC) Our method factorizes multi-view representations into two independent sets of factors: view-consistent and view-specific. Our framework innovatively decomposes consistent representation learning into three key sub-objectives.
• Score: 9.905528765058541
• License:
• Abstract: Multi-view multi-label classification (MvMLC) has recently garnered significant research attention due to its wide range of real-world applications. However, incompleteness in views and labels is a common challenge, often resulting from data collection oversights and uncertainties in manual annotation. Furthermore, the task of learning robust multi-view representations that are both view-consistent and view-specific from diverse views still a challenge problem in MvMLC. To address these issues, we propose a novel framework for incomplete multi-view multi-label classification (iMvMLC). Our method factorizes multi-view representations into two independent sets of factors: view-consistent and view-specific, and we correspondingly design a graph disentangling loss to fully reduce redundancy between these representations. Additionally, our framework innovatively decomposes consistent representation learning into three key sub-objectives: (i) how to extract view-shared information across different views, (ii) how to eliminate intra-view redundancy in consistent representations, and (iii) how to preserve task-relevant information. To this end, we design a robust task-relevant consistency learning module that collaboratively learns high-quality consistent representations, leveraging a masked cross-view prediction (MCP) strategy and information theory. Notably, all modules in our framework are developed to function effectively under conditions of incomplete views and labels, making our method adaptable to various multi-view and multi-label datasets. Extensive experiments on five datasets demonstrate that our method outperforms other leading approaches.

Related papers

• CDIMC-net: Cognitive Deep Incomplete Multi-view Clustering Network [53.72046586512026]
  We propose a novel incomplete multi-view clustering network, called Cognitive Deep Incomplete Multi-view Clustering Network (CDIMC-net) It captures the high-level features and local structure of each view by incorporating the view-specific deep encoders and graph embedding strategy into a framework. Based on the human cognition, i.e., learning from easy to hard, it introduces a self-paced strategy to select the most confident samples for model training.
  arXiv  Detail & Related papers  (2024-03-28T15:45:03Z)
• Incomplete Contrastive Multi-View Clustering with High-Confidence Guiding [7.305817202715752]
  We propose a novel Incomplete Contrastive Multi-View Clustering method with high-confidence guiding (ICMVC) Firstly, we proposed a multi-view consistency relation transfer plus graph convolutional network to tackle missing values problem. Secondly, instance-level attention fusion and high-confidence guiding are proposed to exploit the complementary information.
  arXiv  Detail & Related papers  (2023-12-14T07:28:41Z)
• M$^3$Net: Multi-view Encoding, Matching, and Fusion for Few-shot Fine-grained Action Recognition [80.21796574234287]
  M$3$Net is a matching-based framework for few-shot fine-grained (FS-FG) action recognition. It incorporates textitmulti-view encoding, textitmulti-view matching, and textitmulti-view fusion to facilitate embedding encoding, similarity matching, and decision making. Explainable visualizations and experimental results demonstrate the superiority of M$3$Net in capturing fine-grained action details.
  arXiv  Detail & Related papers  (2023-08-06T09:15:14Z)
• Reliable Representations Learning for Incomplete Multi-View Partial Multi-Label Classification [78.15629210659516]
  In this paper, we propose an incomplete multi-view partial multi-label classification network named RANK. We break through the view-level weights inherent in existing methods and propose a quality-aware sub-network to dynamically assign quality scores to each view of each sample. Our model is not only able to handle complete multi-view multi-label datasets, but also works on datasets with missing instances and labels.
  arXiv  Detail & Related papers  (2023-03-30T03:09:25Z)
• DICNet: Deep Instance-Level Contrastive Network for Double Incomplete Multi-View Multi-Label Classification [20.892833511657166]
  Multi-view multi-label data in the real world is commonly incomplete due to the uncertain factors of data collection and manual annotation. We propose a deep instance-level contrastive network, namely DICNet, to deal with the double incomplete multi-view multi-label classification problem. Our DICNet is adept in capturing consistent discriminative representations of multi-view multi-label data and avoiding the negative effects of missing views and missing labels.
  arXiv  Detail & Related papers  (2023-03-15T04:24:01Z)
• Incomplete Multi-View Multi-Label Learning via Label-Guided Masked View- and Category-Aware Transformers [19.720564730308993]
  We propose a general multi-view multi-label learning framework named label-guided masked view- and category-aware transformers. Considering the imbalance of expressive power among views, an adaptively weighted view fusion module is proposed to obtain view-consistent embedding features.
  arXiv  Detail & Related papers  (2023-03-13T15:22:50Z)
• Cross-view Graph Contrastive Representation Learning on Partially Aligned Multi-view Data [52.491074276133325]
  Multi-view representation learning has developed rapidly over the past decades and has been applied in many fields. We propose a new cross-view graph contrastive learning framework, which integrates multi-view information to align data and learn latent representations. Experiments conducted on several real datasets demonstrate the effectiveness of the proposed method on the clustering and classification tasks.
  arXiv  Detail & Related papers  (2022-11-08T09:19:32Z)
• Deep Partial Multi-View Learning [94.39367390062831]
  We propose a novel framework termed Cross Partial Multi-View Networks (CPM-Nets) We fifirst provide a formal defifinition of completeness and versatility for multi-view representation. We then theoretically prove the versatility of the learned latent representations.
  arXiv  Detail & Related papers  (2020-11-12T02:29:29Z)
• Multi-view Low-rank Preserving Embedding: A Novel Method for Multi-view Representation [11.91574721055601]
  This paper proposes a novel multi-view learning method, named Multi-view Low-rank Preserving Embedding (MvLPE) It integrates different views into one centroid view by minimizing the disagreement term, based on distance or similarity matrix among instances. Experiments on six benchmark datasets demonstrate that the proposed method outperforms its counterparts.
  arXiv  Detail & Related papers  (2020-06-14T12:47:25Z)
• Generative Partial Multi-View Clustering [133.36721417531734]
  We propose a generative partial multi-view clustering model, named as GP-MVC, to address the incomplete multi-view problem. First, multi-view encoder networks are trained to learn common low-dimensional representations, followed by a clustering layer to capture the consistent cluster structure across multiple views. Second, view-specific generative adversarial networks are developed to generate the missing data of one view conditioning on the shared representation given by other views.
  arXiv  Detail & Related papers  (2020-03-29T17:48:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.