IEEE Transactions on Affective Computing · 2022 · 68 citations · 38 references
ComputingComputer ScienceComputational NeuroscienceMachine LearningNeural EngineeringElectroencephalogram AnalysisElectroencephalogram Signal ProcessingElectroencephalographyEmotion RecognitionRepresentation LearningSemi-supervised LearningAutomatic Emotion RecognitionEeg Signal ProcessingLabelsMachine Learning For ElectroencephalogramSemi-supervised Feature LearningSemi-supervised ModelsSemi-supervised Representation Learning
We propose pairwise alignment of representations for semi-supervised Electroencephalogram (EEG) learning (PARSE), a novel semi-supervised architecture for learning reliable EEG representations for emotion recognition. To reduce the potential distribution mismatch between large amounts of unlabeled data and a limited number of labeled data, PARSE uses pairwise representation alignment. First, our model performs data augmentation followed by label guessing for large amounts of original and augmented unlabeled data. The model is then followed by sharpening the guessed labels and convex combinations of the unlabeled and labeled data. Finally, it performs representation alignment and emotion classification. To rigorously test our model, we compare PARSE to several state-of-the-art semi-supervised approaches, which we implement and adapt for EEG learning. We perform these experiments on four public EEG-based emotion recognition datasets, SEED, SEED-IV, SEED-V and AMIGOS (valence and arousal). The experiments show that our proposed framework achieves the overall best results with varying amounts of limited labeled samples in SEED, SEED-IV and AMIGOS (valence), while approaching the overall best result (reaching the second-best) in SEED-V and AMIGOS (arousal). The analysis shows that our pairwise representation alignment considerably improves the performance by performing the distribution alignment between unlabeled and labeled data, especially when only 1 sample per class is labeled. The source code of our article is publicly available at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/guangyizhangbci/PARSE</uri> .
38
Adam: A Method for Stochastic Optimization
Diederik P. Kingma, Jimmy Ba · UvA-DARE (University of Amsterdam) · 2014 · 84.8K citations · Full text
mixup: Beyond Empirical Risk Minimization
Hongyi Zhang, Moustapha Cissé, Yann Dauphin et al. · arXiv (Cornell University) · 2017 · 4.8K citations · Full text
A survey on semi-supervised learning
Jesper E. van Engelen, Holger H. Hoos · Machine Learning · 2019 · 2.6K citations · Full text
FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidence
Kihyuk Sohn, David Berthelot, Chunliang Li et al. · arXiv (Cornell University) · 2020 · 2.3K citations · Full text