Adaptive deep feature representation learning for cross-subject EEG decoding.

IF 2.9 3区 生物学 Q2 BIOCHEMICAL RESEARCH METHODS BMC Bioinformatics Pub Date : 2024-12-31 DOI:10.1186/s12859-024-06024-w
Shuang Liang, Linzhe Li, Wei Zu, Wei Feng, Wenlong Hang
{"title":"Adaptive deep feature representation learning for cross-subject EEG decoding.","authors":"Shuang Liang, Linzhe Li, Wei Zu, Wei Feng, Wenlong Hang","doi":"10.1186/s12859-024-06024-w","DOIUrl":null,"url":null,"abstract":"<p><strong>Background: </strong>The collection of substantial amounts of electroencephalogram (EEG) data is typically time-consuming and labor-intensive, which adversely impacts the development of decoding models with strong generalizability, particularly when the available data is limited. Utilizing sufficient EEG data from other subjects to aid in modeling the target subject presents a potential solution, commonly referred to as domain adaptation. Most current domain adaptation techniques for EEG decoding primarily focus on learning shared feature representations through domain alignment strategies. Since the domain shift cannot be completely removed, target EEG samples located near the edge of clusters are also susceptible to misclassification.</p><p><strong>Methods: </strong>We propose a novel adaptive deep feature representation (ADFR) framework to improve the cross-subject EEG classification performance through learning transferable EEG feature representations. Specifically, we first minimize the distribution discrepancy between the source and target domains by employing maximum mean discrepancy (MMD) regularization, which aids in learning the shared feature representations. We then utilize the instance-based discriminative feature learning (IDFL) regularization to make the learned feature representations more discriminative. Finally, the entropy minimization (EM) regularization is further integrated to adjust the classifier to pass through the low-density region between clusters. The synergistic learning between above regularizations during the training process enhances EEG decoding performance across subjects.</p><p><strong>Results: </strong>The effectiveness of the ADFR framework was evaluated on two public motor imagery (MI)-based EEG datasets: BCI Competition III dataset 4a and BCI Competition IV dataset 2a. In terms of average accuracy, ADFR achieved improvements of 3.0% and 2.1%, respectively, over the state-of-the-art methods on these datasets.</p><p><strong>Conclusions: </strong>The promising results highlight the effectiveness of the ADFR algorithm for EEG decoding and show its potential for practical applications.</p>","PeriodicalId":8958,"journal":{"name":"BMC Bioinformatics","volume":"25 1","pages":"393"},"PeriodicalIF":2.9000,"publicationDate":"2024-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11686875/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"BMC Bioinformatics","FirstCategoryId":"99","ListUrlMain":"https://doi.org/10.1186/s12859-024-06024-w","RegionNum":3,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"BIOCHEMICAL RESEARCH METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Background: The collection of substantial amounts of electroencephalogram (EEG) data is typically time-consuming and labor-intensive, which adversely impacts the development of decoding models with strong generalizability, particularly when the available data is limited. Utilizing sufficient EEG data from other subjects to aid in modeling the target subject presents a potential solution, commonly referred to as domain adaptation. Most current domain adaptation techniques for EEG decoding primarily focus on learning shared feature representations through domain alignment strategies. Since the domain shift cannot be completely removed, target EEG samples located near the edge of clusters are also susceptible to misclassification.

Methods: We propose a novel adaptive deep feature representation (ADFR) framework to improve the cross-subject EEG classification performance through learning transferable EEG feature representations. Specifically, we first minimize the distribution discrepancy between the source and target domains by employing maximum mean discrepancy (MMD) regularization, which aids in learning the shared feature representations. We then utilize the instance-based discriminative feature learning (IDFL) regularization to make the learned feature representations more discriminative. Finally, the entropy minimization (EM) regularization is further integrated to adjust the classifier to pass through the low-density region between clusters. The synergistic learning between above regularizations during the training process enhances EEG decoding performance across subjects.

Results: The effectiveness of the ADFR framework was evaluated on two public motor imagery (MI)-based EEG datasets: BCI Competition III dataset 4a and BCI Competition IV dataset 2a. In terms of average accuracy, ADFR achieved improvements of 3.0% and 2.1%, respectively, over the state-of-the-art methods on these datasets.

Conclusions: The promising results highlight the effectiveness of the ADFR algorithm for EEG decoding and show its potential for practical applications.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于自适应深度特征表示学习的脑电解码。
背景:大量脑电图(EEG)数据的收集通常是耗时和劳动密集型的,这对具有强泛化性的解码模型的发展产生了不利影响,特别是当可用数据有限时。利用来自其他受试者的足够的EEG数据来帮助目标受试者建模,提出了一种潜在的解决方案,通常称为领域适应。目前大多数面向脑电图解码的领域自适应技术主要集中在通过领域对齐策略学习共享特征表示。由于不能完全去除域偏移,位于聚类边缘附近的目标EEG样本也容易出现误分类。方法:提出一种新的自适应深度特征表示(ADFR)框架,通过学习可转移的脑电信号特征表示来提高脑电信号的跨主题分类性能。具体来说,我们首先通过使用最大平均差异(MMD)正则化来最小化源域和目标域之间的分布差异,这有助于学习共享特征表示。然后,我们利用基于实例的判别特征学习(IDFL)正则化使学习到的特征表示更具判别性。最后,进一步结合熵最小化(EM)正则化,调整分类器通过聚类之间的低密度区域。在训练过程中,上述正则化之间的协同学习提高了脑电解码的跨对象性能。结果:ADFR框架的有效性在两个公共的基于运动图像(MI)的EEG数据集上进行了评估:BCI Competition III数据集4a和BCI Competition IV数据集2a。就平均准确率而言,ADFR在这些数据集上分别比最先进的方法提高了3.0%和2.1%。结论:本研究结果显示了ADFR算法在脑电图解码中的有效性,显示了其实际应用潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
BMC Bioinformatics
BMC Bioinformatics 生物-生化研究方法
CiteScore
5.70
自引率
3.30%
发文量
506
审稿时长
4.3 months
期刊介绍: BMC Bioinformatics is an open access, peer-reviewed journal that considers articles on all aspects of the development, testing and novel application of computational and statistical methods for the modeling and analysis of all kinds of biological data, as well as other areas of computational biology. BMC Bioinformatics is part of the BMC series which publishes subject-specific journals focused on the needs of individual research communities across all areas of biology and medicine. We offer an efficient, fair and friendly peer review service, and are committed to publishing all sound science, provided that there is some advance in knowledge presented by the work.
期刊最新文献
AMEND 2.0: module identification and multi-omic data integration with multiplex-heterogeneous graphs. BioLake: an RNA expression analysis framework for prostate cancer biomarker powered by data lakehouse. CellMAP: an open-source software tool to batch-process cell topography and stiffness maps collected with an atomic force microscope. Accurate assembly of full-length consensus for viral quasispecies. Flexible analysis of spatial transcriptomics data (FAST): a deconvolution approach.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1