.png){kind=icon}
.png){kind=icon}
Return
An adaptive matrix-based evolutionary computation framework for EEG feature selection
.png){kind=icon}
PRE
AI
DOI：10.1007/s12293-024-00434-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Electroencephalogram (EEG) plays a significant role in emotion recognition because it contains abundant information. However, due to the highly correlated EEG channels, a lot of redundant EEG features exist, which not only potentially degrade the emotion recognition accuracy, but also bring high computational costs. To address this challenge, this paper proposes an adaptive matrix-based evolutionary computation framework (AMEC) to select as few informative EEG features as possible for effective emotion recognition. Unlike most existing EC algorithms that utilize vector-based operations, this framework leverages matrix-based operations to reduce feature redundancy and improve classification accuracy by dynamically adjusting the feature subset size according to the characteristics of the dataset. In such a way, the selection efficiency is largely improved. To verify the effectiveness and efficiency of this framework, the classical genetic algorithm, the typical particle swarm optimization algorithm, and the classical differential evolution algorithm, are respectively embedded into this framework for EEG feature selection, and then evaluated on three widely used public EEG datasets for emotion recognition. Compared with several state-of-the-art EEG feature selection algorithms, the devised framework is much more effective in terms of the classification accuracy and the computational efficiency. In addition, the experimental results further reveal that the selected feature subsets are very different for different genders. This indicates the demand of gender-sensitive EEG feature selection for emotion recognition.
Keywords:
EEG
Feature selection
Matrix-based evolutionary computation
Emotion recognition
Evolutionary algorithms
Journal
IF:
2.3
Papers:
447
Citations:
718