Evidential Deep Partial Multi-View Classification With Discount Fusion

• URL: http://arxiv.org/abs/2408.13123v3
• Date: Fri, 30 Aug 2024 09:06:06 GMT
• Title: Evidential Deep Partial Multi-View Classification With Discount Fusion
• Authors: Haojian Huang, Zhe Liu, Sukumar Letchmunan, Muhammet Deveci, Mingwei Lin, Weizhong Wang,
• Abstract summary: We propose a novel framework called Evidential Deep Partial Multi-View Classification (EDP-MVC) We use K-means imputation to address missing views, creating a complete set of multi-view data. The potential conflicts and uncertainties within this imputed data can affect the reliability of downstream inferences.
• Score: 24.139495744683128
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Incomplete multi-view data classification poses significant challenges due to the common issue of missing views in real-world scenarios. Despite advancements, existing methods often fail to provide reliable predictions, largely due to the uncertainty of missing views and the inconsistent quality of imputed data. To tackle these problems, we propose a novel framework called Evidential Deep Partial Multi-View Classification (EDP-MVC). Initially, we use K-means imputation to address missing views, creating a complete set of multi-view data. However, the potential conflicts and uncertainties within this imputed data can affect the reliability of downstream inferences. To manage this, we introduce a Conflict-Aware Evidential Fusion Network (CAEFN), which dynamically adjusts based on the reliability of the evidence, ensuring trustworthy discount fusion and producing reliable inference outcomes. Comprehensive experiments on various benchmark datasets reveal EDP-MVC not only matches but often surpasses the performance of state-of-the-art methods.

Related papers

• Dynamic Evidence Decoupling for Trusted Multi-view Learning [17.029245880233816]
  We propose a Consistent and Complementary-aware trusted Multi-view Learning (CCML) method to solve this problem. We first construct view opinions using evidential deep neural networks, which consist of belief mass vectors and uncertainty estimates. The results validate the effectiveness of the dynamic evidence decoupling strategy and show that CCML significantly outperforms baselines on accuracy and reliability.
  arXiv  Detail & Related papers  (2024-10-04T03:27:51Z)
• Towards Robust Uncertainty-Aware Incomplete Multi-View Classification [11.617211995206018]
  We propose the Alternating Progressive Learning Network (APLN) to enhance EDL-based methods in incomplete MVC scenarios. APLN mitigates bias from corrupted observed data by first applying coarse imputation, followed by mapping the data to a latent space. We also introduce a conflict-aware Dempster-Shafer combination rule (DSCR) to better handle conflicting evidence.
  arXiv  Detail & Related papers  (2024-09-10T07:18:57Z)
• Regularized Contrastive Partial Multi-view Outlier Detection [76.77036536484114]
  We propose a novel method named Regularized Contrastive Partial Multi-view Outlier Detection (RCPMOD) In this framework, we utilize contrastive learning to learn view-consistent information and distinguish outliers by the degree of consistency. Experimental results on four benchmark datasets demonstrate that our proposed approach could outperform state-of-the-art competitors.
  arXiv  Detail & Related papers  (2024-08-02T14:34:27Z)
• Navigating Conflicting Views: Harnessing Trust for Learning [5.4486293124577125]
  We develop a computational trust-based discounting method to enhance the existing trustworthy framework. We evaluate our method on six real-world datasets, using Top-1 Accuracy, AUC-ROC for Uncertainty-Aware Prediction, Fleiss' Kappa, and a new metric called Multi-View Agreement with Ground Truth.
  arXiv  Detail & Related papers  (2024-06-03T03:22:18Z)
• Measuring Adversarial Datasets [28.221635644616523]
  Researchers have curated various adversarial datasets for capturing model deficiencies that cannot be revealed in standard benchmark datasets. There is still no methodology to measure the intended and unintended consequences of those adversarial transformations. We conducted a systematic survey of existing quantifiable metrics that describe text instances in NLP tasks.
  arXiv  Detail & Related papers  (2023-11-06T22:08:16Z)
• Exploring and Exploiting Uncertainty for Incomplete Multi-View Classification [47.82610025809371]
  We propose an Uncertainty-induced Incomplete Multi-View Data Classification (UIMC) model to classify incomplete multi-view data. Specifically, we model each missing data with a distribution conditioning on the available views and thus introducing uncertainty. Our method establishes a state-of-the-art performance in terms of both performance and trustworthiness.
  arXiv  Detail & Related papers  (2023-04-11T11:57:48Z)
• Deep Incomplete Multi-view Clustering with Cross-view Partial Sample and Prototype Alignment [50.82982601256481]
  We propose a Cross-view Partial Sample and Prototype Alignment Network (CPSPAN) for Deep Incomplete Multi-view Clustering. Unlike existing contrastive-based methods, we adopt pair-observed data alignment as 'proxy supervised signals' to guide instance-to-instance correspondence construction.
  arXiv  Detail & Related papers  (2023-03-28T02:31:57Z)
• Variational Distillation for Multi-View Learning [104.17551354374821]
  We design several variational information bottlenecks to exploit two key characteristics for multi-view representation learning. Under rigorously theoretical guarantee, our approach enables IB to grasp the intrinsic correlation between observations and semantic labels.
  arXiv  Detail & Related papers  (2022-06-20T03:09:46Z)
• Trusted Multi-View Classification with Dynamic Evidential Fusion [73.35990456162745]
  We propose a novel multi-view classification algorithm, termed trusted multi-view classification (TMC) TMC provides a new paradigm for multi-view learning by dynamically integrating different views at an evidence level. Both theoretical and experimental results validate the effectiveness of the proposed model in accuracy, robustness and trustworthiness.
  arXiv  Detail & Related papers  (2022-04-25T03:48:49Z)
• Trusted Multi-View Classification [76.73585034192894]
  We propose a novel multi-view classification method, termed trusted multi-view classification. It provides a new paradigm for multi-view learning by dynamically integrating different views at an evidence level. The proposed algorithm jointly utilizes multiple views to promote both classification reliability and robustness.
  arXiv  Detail & Related papers  (2021-02-03T13:30:26Z)

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.