DAGAM: a domain adversarial graph attention model for subject-independent EEG-based emotion recognition

计算机科学 脑电图 概化理论 人工智能 图形 模式识别(心理学) 联营 机器学习 语音识别 理论计算机科学 心理学 数学 统计 精神科
作者
Tao Xu,Wang Dang,Jiabao Wang,Yun Zhou
出处
期刊:Journal of Neural Engineering [IOP Publishing]
卷期号:20 (1): 016022-016022 被引量:6
标识
DOI:10.1088/1741-2552/acae06
摘要

Abstract Objective. Due to individual differences in electroencephalogram (EEG) signals, the learning model built by the subject-dependent technique from one person’s data would be inaccurate when applied to another person for emotion recognition. Thus, the subject-dependent approach for emotion recognition may result in poor generalization performance when compared to the subject-independent approach. However, existing studies have attempted but have not fully utilized EEG’s topology, nor have they solved the problem caused by the difference in data distribution between the source and target domains. Approach. To eliminate individual differences in EEG signals, this paper proposes the domain adversarial graph attention model, a novel EEG-based emotion recognition model. The basic idea is to generate a graph using biological topology to model multichannel EEG signals. Graph theory can topologically describe and analyze EEG channel relationships and mutual dependencies. Then, unlike other graph convolutional networks, self-attention pooling is used to benefit from the extraction of salient EEG features from the graph, effectively improving performance. Finally, following graph pooling, the domain adversarial model based on the graph is used to identify and handle EEG variation across subjects, achieving good generalizability efficiently. Main Results. We conduct extensive evaluations on two benchmark data sets (SEED and SEED IV) and obtain cutting-edge results in subject-independent emotion recognition. Our model boosts the SEED accuracy to 92.59% (4.06% improvement) with the lowest standard deviation (STD) of 3.21% (2.46% decrements) and SEED IV accuracy to 80.74% (6.90% improvement) with the lowest STD of 4.14% (3.88% decrements), respectively. The computational complexity is drastically reduced in comparison to similar efforts (33 times lower). Significance. We have developed a model that significantly reduces the computation time while maintaining accuracy, making EEG-based emotion decoding more practical and generalizable.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
传奇3应助biocreater采纳,获得10
刚刚
yilin完成签到,获得积分10
刚刚
CipherSage应助发疯采纳,获得10
2秒前
温柔的邴完成签到,获得积分10
3秒前
Selonfer完成签到,获得积分10
4秒前
daisy应助breeze采纳,获得50
4秒前
dfjeid完成签到,获得积分20
6秒前
6秒前
10秒前
英姑应助温柔的邴采纳,获得10
11秒前
yiyu应助小鲤鱼吃大菠萝采纳,获得10
11秒前
Orange应助富士山下采纳,获得10
13秒前
小马甲应助自然采纳,获得10
13秒前
任性土豆完成签到,获得积分10
14秒前
xukh发布了新的文献求助10
15秒前
17秒前
17秒前
hdy331完成签到,获得积分10
18秒前
19秒前
科研通AI2S应助ohno耶耶耶采纳,获得10
20秒前
自然完成签到,获得积分20
20秒前
爱听歌白梅关注了科研通微信公众号
21秒前
21秒前
21秒前
22秒前
阿洁发布了新的文献求助10
22秒前
小二郎应助xukh采纳,获得10
23秒前
富士山下发布了新的文献求助10
24秒前
24秒前
自然发布了新的文献求助10
25秒前
落寞如容完成签到,获得积分10
28秒前
小Li完成签到 ,获得积分10
28秒前
little elvins完成签到 ,获得积分10
31秒前
38秒前
小Li发布了新的文献求助10
39秒前
离开时是天命完成签到,获得积分10
39秒前
星辰大海应助单薄的凡灵采纳,获得10
40秒前
爱学习的胡小毛完成签到,获得积分20
40秒前
41秒前
lu发布了新的文献求助30
42秒前
高分求助中
【本贴是提醒信息,请勿应助】请在求助之前详细阅读求助说明!!!! 20000
One Man Talking: Selected Essays of Shao Xunmei, 1929–1939 1000
The Three Stars Each: The Astrolabes and Related Texts 900
Yuwu Song, Biographical Dictionary of the People's Republic of China 800
Multifunctional Agriculture, A New Paradigm for European Agriculture and Rural Development 600
Challenges, Strategies, and Resiliency in Disaster and Risk Management 500
Bernd Ziesemer - Maos deutscher Topagent: Wie China die Bundesrepublik eroberte 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2481635
求助须知:如何正确求助?哪些是违规求助? 2144263
关于积分的说明 5469258
捐赠科研通 1866782
什么是DOI,文献DOI怎么找? 927804
版权声明 563039
科研通“疑难数据库(出版商)”最低求助积分说明 496402