• Home
  • Search
  • Possibilistic distribution distance metric: a robust domain adaptation learning method
  • Cite Icon3
  • https://doi.org/10.3389/fnins.2023.1247082Copy DOI Icon

Possibilistic distribution distance metric: a robust domain adaptation learning method

Show More
  • Abstract
  • Highlights & Summary
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The affective Brain-Computer Interface (aBCI) systems, which achieve predictions for individual subjects through training on multiple subjects, often cannot achieve satisfactory results due to the differences in Electroencephalogram (EEG) patterns between subjects. One tried to use Subject-specific classifiers, but there was a lack of sufficient labeled data. To solve this problem, Domain Adaptation (DA) has recently received widespread attention in the field of EEG-based emotion recognition. Domain adaptation (DA) learning aims to solve the problem of inconsistent distributions between training and test datasets and has received extensive attention. Most existing methods use Maximum Mean Discrepancy (MMD) or its variants to minimize the problem of domain distribution inconsistency. However, noisy data in the domain can lead to significant drift in domain means, which can affect the adaptability performance of learning methods based on MMD and its variants to some extent. Therefore, we propose a robust domain adaptation learning method with possibilistic distribution distance measure. Firstly, the traditional MMD criterion is transformed into a novel possibilistic clustering model to weaken the influence of noisy data, thereby constructing a robust possibilistic distribution distance metric (P-DDM) criterion. Then the robust effectiveness of domain distribution alignment is further improved by a fuzzy entropy regularization term. The proposed P-DDM is in theory proved which be an upper bound of the traditional distribution distance measure method MMD criterion under certain conditions. Therefore, minimizing P-DDM can effectively optimize the MMD objective. Secondly, based on the P-DDM criterion, a robust domain adaptation classifier based on P-DDM (C-PDDM) is proposed, which adopts the Laplacian matrix to preserve the geometric consistency of instances in the source domain and target domain for improving the label propagation performance. At the same time, by maximizing the use of source domain discriminative information to minimize domain discrimination error, the generalization performance of the learning model is further improved. Finally, a large number of experiments and analyses on multiple EEG datasets (i.e., SEED and SEED-IV) show that the proposed method has superior or comparable robustness performance (i.e., has increased by around 10%) in most cases.

Loading PDF

Similar Papers
  • Research Article
  • Citations2

Discriminative possibilistic clustering promoting cross-domain emotion recognition.

  • Nov 01, 2024
  • Frontiers in neuroscience
  • Yufang Dan +2
  • Research Article
  • Citations48

Maximum Mean and Covariance Discrepancy for Unsupervised Domain Adaptation

  • Aug 08, 2019
  • Neural Processing Letters
  • Wenju Zhang +3
  • Conference Article
  • Citations692

Mind the Class Weight Bias: Weighted Maximum Mean Discrepancy for Unsupervised Domain Adaptation

  • Jul 01, 2017
  • Hongliang Yan +5
  • Research Article
  • Citations4

Domain-Invariant Feature Learning for Domain Adaptation

  • Mar 03, 2023
  • International Journal of Pattern Recognition and Artificial Intelligence
  • Ching-Ting Tu +4
  • Research Article
  • Citations113

Weighted and Class-Specific Maximum Mean Discrepancy for Unsupervised Domain Adaptation

  • Nov 22, 2019
  • IEEE Transactions on Multimedia
  • Hongliang Yan +5
  • Conference Article
  • Citations3

Modeling Sequential Domain Shift through Estimation of Optimal Sub-spaces for Categorization

  • Jan 01, 2014
  • Suranjana Samanta +2
  • Research Article
  • Citations15

Discriminative and domain invariant subspace alignment for visual tasks

  • Jun 03, 2019
  • Iran Journal of Computer Science
  • Samaneh Rezaei +1
  • Conference Article
  • Citations107

Discriminative Joint Probability Maximum Mean Discrepancy (DJP-MMD) for Domain Adaptation

  • Jul 01, 2020
  • Wen Zhang +1
  • Research Article
  • Citations41

Learning Causal Representations for Robust Domain Adaptation

  • Jan 01, 2021
  • IEEE Transactions on Knowledge and Data Engineering
  • Shuai Yang +5
  • Book Chapter
  • Citations2

Unsupervised Domain Adaptation for Object Detection Using Distribution Matching in Various Feature Level

  • Jan 01, 2019
  • Hyoungwoo Park +3
  • Conference Article
  • Citations30

Towards Accurate and Robust Domain Adaptation under Noisy Environments

  • Jul 01, 2020
  • Zhongyi Han +3
  • Conference Article
  • Citations2

Unsupervised Domain Adaptation by regularizing Softmax Activation

  • Aug 01, 2018
  • Cunbin Gui +1
  • PDF
  • Research Article
  • Citations9

A Domain Adaption ResNet Model to Detect Faults in Roller Bearings Using Vibro-Acoustic Data.

  • Mar 13, 2023
  • Sensors
  • Yi Liu +3
  • Research Article
  • Citations55

Adversarial domain adaptation convolutional neural network for intelligent recognition of bearing faults

  • Apr 04, 2022
  • Measurement
  • Yaochun Wu +5
  • Research Article
  • Citations141

Intelligent Fault Diagnosis Under Varying Working Conditions Based on Domain Adaptive Convolutional Neural Networks

  • Jan 01, 2018
  • IEEE Access
  • Bo Zhang +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.