Adaptive deep feature representation learning for cross-subject EEG decoding

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...

Full description

Saved in:
Bibliographic Details
Published inBMC bioinformatics Vol. 25; no. 1; pp. 393 - 19
Main Authors Liang, Shuang, Li, Linzhe, Zu, Wei, Feng, Wei, Hang, Wenlong
Format Journal Article
LanguageEnglish
Published England BioMed Central Ltd 31.12.2024
BioMed Central
BMC
Subjects
Online AccessGet full text

Cover

Loading…
Abstract 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. 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. 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. The promising results highlight the effectiveness of the ADFR algorithm for EEG decoding and show its potential for practical applications.
AbstractList 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. Keywords: Electroencephalogram, Domain adaptation, Discriminative feature learning, Entropy minimization, Motor imagery
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. 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. 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. The promising results highlight the effectiveness of the ADFR algorithm for EEG decoding and show its potential for practical applications.
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.
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.BACKGROUNDThe 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.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.METHODSWe 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.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.RESULTSThe 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.The promising results highlight the effectiveness of the ADFR algorithm for EEG decoding and show its potential for practical applications.CONCLUSIONSThe promising results highlight the effectiveness of the ADFR algorithm for EEG decoding and show its potential for practical applications.
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. 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. 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. The promising results highlight the effectiveness of the ADFR algorithm for EEG decoding and show its potential for practical applications.
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.
ArticleNumber 393
Audience Academic
Author Li, Linzhe
Liang, Shuang
Hang, Wenlong
Feng, Wei
Zu, Wei
Author_xml – sequence: 1
  givenname: Shuang
  surname: Liang
  fullname: Liang, Shuang
– sequence: 2
  givenname: Linzhe
  surname: Li
  fullname: Li, Linzhe
– sequence: 3
  givenname: Wei
  surname: Zu
  fullname: Zu, Wei
– sequence: 4
  givenname: Wei
  surname: Feng
  fullname: Feng, Wei
– sequence: 5
  givenname: Wenlong
  surname: Hang
  fullname: Hang, Wenlong
BackLink https://www.ncbi.nlm.nih.gov/pubmed/39741250$$D View this record in MEDLINE/PubMed
BookMark eNptkl9v0zAUxS00xLbCF-ABReIFHjJ87dhxnlA1lVGpEhJ_ni3XuS6u0jjYyQbfHrcdY0XIUmzZv3uic3QuyVkfeiTkJdArACXfJWBKNCVlVUnl_nv3hFxAVUPJgIqzR-dzcpnSllKoFRXPyDlv6gqYoBdkNW_NMPpbLFrEoXBoxiliEXGImLAfzehDX3RoYu_7TeFCLGwMKZVpWm_RjsVicZNHbWjz83Py1Jku4Yv7fUa-fVh8vf5Yrj7dLK_nq9KKqhlLzpRD56R1LdBGctkoAw0XUvEK1qZay0oxU7uqNVQwzjmKKhtUDW2looB8RpZH3TaYrR6i35n4Swfj9eEixI02cfS2Qy0MGqOyW-Ss4uAMcwqMUjkJsUZls9b7o9YwrXfY2uw5mu5E9PSl99_1JtxqAKmkqkVWeHOvEMOPCdOodz5Z7DrTY5iS5iD2NgAgo6__Qbdhin3Oak8xqRjw-i-1MdmB713IP7Z7UT3PRJODyqnMyNV_qLxa3Hmbm-J8vj8ZeHsykJkRf44bM6Wkl18-n7KvHqfyEMef4mSAHYFDGyK6BwSo3rdTH9upcy_1oZ36jv8GcRPTQQ
Cites_doi 10.1016/j.eswa.2024.125452
10.1109/TBME.2017.2742541
10.1109/TNSRE.2021.3059166
10.1109/TNSRE.2018.2884641
10.1088/1741-2552/aace8c
10.1016/j.neucom.2020.09.017
10.1109/CVPR.2014.183
10.1109/JPROC.2015.2404941
10.1016/S1388-2457(02)00057-3
10.1109/MCI.2015.2501545
10.1109/IJCNN.2016.7727726
10.1109/TBME.2010.2093133
10.1109/ACCESS.2019.2939288
10.1016/j.neucom.2011.10.024
10.1016/j.cmpb.2020.105466
10.1109/TCDS.2018.2826840
10.1109/IJCNN.2008.4634130
10.1109/LSP.2009.2022557
10.1088/1741-2552/aaf3f6
10.1109/CVPR52729.2023.00729
10.1109/TNSRE.2023.3243257
10.1109/TNSRE.2019.2923315
10.1016/j.heliyon.2024.e36759
10.1109/RBME.2013.2290621
10.1109/TNSRE.2016.2646763
10.1109/IWW-BCI.2019.8737340
10.3389/fnins.2020.606949
10.1109/NER.2017.8008420
10.1109/TBME.2019.2913914
10.1109/IEMBS.2011.6091042
10.3390/app122412614
10.1088/1741-2560/8/2/025004
10.1109/TPAMI.2018.2868685
10.1109/TNSRE.2023.3285309
10.1109/TNSRE.2016.2601240
10.1109/TNNLS.2020.3010780
10.1109/TBME.2023.3303289
10.1007/978-3-319-26561-2_8
10.1109/86.895946
10.1002/hbm.23730
10.1088/1741-2552/ac6ca8
10.1109/TNNLS.2018.2789927
10.1016/j.neunet.2022.07.011
10.1371/journal.pone.0175856
10.1109/TBME.2013.2253608
10.1007/978-3-319-49409-8_35
10.1016/j.jneumeth.2015.01.033
10.1109/JPROC.2015.2407272
ContentType Journal Article
Copyright 2024. The Author(s).
COPYRIGHT 2024 BioMed Central Ltd.
2024. This work is licensed under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
The Author(s) 2024 2024
Copyright_xml – notice: 2024. The Author(s).
– notice: COPYRIGHT 2024 BioMed Central Ltd.
– notice: 2024. This work is licensed under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
– notice: The Author(s) 2024 2024
DBID AAYXX
CITATION
CGR
CUY
CVF
ECM
EIF
NPM
ISR
3V.
7QO
7SC
7X7
7XB
88E
8AL
8AO
8FD
8FE
8FG
8FH
8FI
8FJ
8FK
ABUWG
AEUYN
AFKRA
ARAPS
AZQEC
BBNVY
BENPR
BGLVJ
BHPHI
CCPQU
DWQXO
FR3
FYUFA
GHDGH
GNUQQ
HCIFZ
JQ2
K7-
K9.
L7M
LK8
L~C
L~D
M0N
M0S
M1P
M7P
P5Z
P62
P64
PHGZM
PHGZT
PIMPY
PJZUB
PKEHL
PPXIY
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
7X8
5PM
DOA
DOI 10.1186/s12859-024-06024-w
DatabaseName CrossRef
Medline
MEDLINE
MEDLINE (Ovid)
MEDLINE
MEDLINE
PubMed
Gale In Context: Science
ProQuest Central (Corporate)
Biotechnology Research Abstracts
Computer and Information Systems Abstracts
Health & Medical Collection
ProQuest Central (purchase pre-March 2016)
Medical Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Natural Science Collection
Hospital Premium Collection
Hospital Premium Collection (Alumni Edition)
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest One Sustainability
ProQuest Central UK/Ireland
Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
Biological Science Collection
ProQuest Central
Technology Collection
Natural Science Collection
ProQuest One
ProQuest Central
Engineering Research Database
Health Research Premium Collection
Health Research Premium Collection (Alumni)
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database (ProQuest)
ProQuest Health & Medical Complete (Alumni)
Advanced Technologies Database with Aerospace
ProQuest Biological Science Collection
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Health & Medical Collection (Alumni)
Medical Database
Biological Science Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Biotechnology and BioEngineering Abstracts
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest Health & Medical Research Collection
ProQuest One Academic Middle East (New)
ProQuest One Health & Nursing
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
MEDLINE - Academic
PubMed Central (Full Participant titles)
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
MEDLINE
Medline Complete
MEDLINE with Full Text
PubMed
MEDLINE (Ovid)
Publicly Available Content Database
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest Central China
ProQuest One Applied & Life Sciences
ProQuest One Sustainability
Health Research Premium Collection
Natural Science Collection
Health & Medical Research Collection
Biological Science Collection
ProQuest Central (New)
ProQuest Medical Library (Alumni)
Advanced Technologies & Aerospace Collection
ProQuest Biological Science Collection
ProQuest One Academic Eastern Edition
ProQuest Hospital Collection
ProQuest Technology Collection
Health Research Premium Collection (Alumni)
Biological Science Database
ProQuest Hospital Collection (Alumni)
Biotechnology and BioEngineering Abstracts
ProQuest Health & Medical Complete
ProQuest One Academic UKI Edition
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Health & Medical Complete (Alumni)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest One Health & Nursing
ProQuest Natural Science Collection
ProQuest Pharma Collection
ProQuest Central
ProQuest Health & Medical Research Collection
Biotechnology Research Abstracts
Health and Medicine Complete (Alumni Edition)
ProQuest Central Korea
Advanced Technologies Database with Aerospace
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest Medical Library
ProQuest Central (Alumni)
MEDLINE - Academic
DatabaseTitleList

Publicly Available Content Database
MEDLINE - Academic

MEDLINE

Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: NPM
  name: PubMed
  url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 3
  dbid: EIF
  name: MEDLINE
  url: https://proxy.k.utb.cz/login?url=https://www.webofscience.com/wos/medline/basic-search
  sourceTypes: Index Database
– sequence: 4
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Biology
EISSN 1471-2105
EndPage 19
ExternalDocumentID oai_doaj_org_article_5aeaa8741e32431fa2f81a881785be8c
PMC11686875
A821956823
39741250
10_1186_s12859_024_06024_w
Genre Journal Article
GeographicLocations China
GeographicLocations_xml – name: China
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 61902197
– fundername: Postgraduate Research & Practice Innovation Program of Jiangsu Province
  grantid: KYCX23_1073
– fundername: Natural Science Research of Jiangsu Higher Education Institutions of China
  grantid: 23KJB520012
GroupedDBID ---
0R~
23N
2WC
53G
5VS
6J9
7X7
88E
8AO
8FE
8FG
8FH
8FI
8FJ
AAFWJ
AAJSJ
AAKPC
AASML
AAYXX
ABDBF
ABUWG
ACGFO
ACGFS
ACIHN
ACIWK
ACPRK
ACUHS
ADBBV
ADMLS
ADUKV
AEAQA
AENEX
AEUYN
AFKRA
AFPKN
AFRAH
AHBYD
AHMBA
AHYZX
ALIPV
ALMA_UNASSIGNED_HOLDINGS
AMKLP
AMTXH
AOIJS
ARAPS
AZQEC
BAPOH
BAWUL
BBNVY
BCNDV
BENPR
BFQNJ
BGLVJ
BHPHI
BMC
BPHCQ
BVXVI
C6C
CCPQU
CITATION
CS3
DIK
DU5
DWQXO
E3Z
EAD
EAP
EAS
EBD
EBLON
EBS
EMB
EMK
EMOBN
ESX
F5P
FYUFA
GNUQQ
GROUPED_DOAJ
GX1
HCIFZ
HMCUK
HYE
IAO
ICD
IHR
INH
INR
ISR
ITC
K6V
K7-
KQ8
LK8
M1P
M48
M7P
MK~
ML0
M~E
O5R
O5S
OK1
OVT
P2P
P62
PGMZT
PHGZM
PHGZT
PIMPY
PQQKQ
PROAC
PSQYO
RBZ
RNS
ROL
RPM
RSV
SBL
SOJ
SV3
TR2
TUS
UKHRP
W2D
WOQ
WOW
XH6
XSB
-A0
3V.
ACRMQ
ADINQ
C24
CGR
CUY
CVF
ECM
EIF
M0N
NPM
PMFND
7QO
7SC
7XB
8AL
8FD
8FK
FR3
JQ2
K9.
L7M
L~C
L~D
P64
PJZUB
PKEHL
PPXIY
PQEST
PQGLB
PQUKI
PRINS
Q9U
7X8
5PM
PUEGO
ID FETCH-LOGICAL-c549t-328feff6cfd10963698a193568341ba4b6482a7f4da052333e54060890d6801e3
IEDL.DBID M48
ISSN 1471-2105
IngestDate Wed Aug 27 01:26:05 EDT 2025
Thu Aug 21 18:35:45 EDT 2025
Fri Jul 11 04:43:47 EDT 2025
Fri Jul 25 19:24:31 EDT 2025
Tue Jun 17 22:00:28 EDT 2025
Tue Jun 10 21:10:14 EDT 2025
Fri Jun 27 05:14:57 EDT 2025
Wed Feb 19 02:03:16 EST 2025
Tue Jul 01 03:38:42 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Domain adaptation
Motor imagery
Electroencephalogram
Discriminative feature learning
Entropy minimization
Language English
License 2024. The Author(s).
Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/.
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c549t-328feff6cfd10963698a193568341ba4b6482a7f4da052333e54060890d6801e3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
OpenAccessLink http://journals.scholarsportal.info/openUrl.xqy?doi=10.1186/s12859-024-06024-w
PMID 39741250
PQID 3152682137
PQPubID 44065
PageCount 19
ParticipantIDs doaj_primary_oai_doaj_org_article_5aeaa8741e32431fa2f81a881785be8c
pubmedcentral_primary_oai_pubmedcentral_nih_gov_11686875
proquest_miscellaneous_3150523111
proquest_journals_3152682137
gale_infotracmisc_A821956823
gale_infotracacademiconefile_A821956823
gale_incontextgauss_ISR_A821956823
pubmed_primary_39741250
crossref_primary_10_1186_s12859_024_06024_w
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2024-12-31
PublicationDateYYYYMMDD 2024-12-31
PublicationDate_xml – month: 12
  year: 2024
  text: 2024-12-31
  day: 31
PublicationDecade 2020
PublicationPlace England
PublicationPlace_xml – name: England
– name: London
PublicationTitle BMC bioinformatics
PublicationTitleAlternate BMC Bioinformatics
PublicationYear 2024
Publisher BioMed Central Ltd
BioMed Central
BMC
Publisher_xml – name: BioMed Central Ltd
– name: BioMed Central
– name: BMC
References 6024_CR14
6024_CR13
6024_CR54
W Samek (6024_CR17) 2013; 7
6024_CR53
6024_CR55
V Jayaram (6024_CR9) 2016; 11
W Samek (6024_CR18) 2013; 60
P Zhang (6024_CR39) 2018; 27
VJ Lawhern (6024_CR37) 2018; 15
6024_CR19
W Tu (6024_CR23) 2012; 82
S Sakhavi (6024_CR40) 2018; 29
6024_CR50
C Vidaurre (6024_CR28) 2010; 58
AM Azab (6024_CR22) 2019; 27
D Hübner (6024_CR27) 2017; 12
H He (6024_CR29) 2019; 67
F Wei (6024_CR52) 2023; 31
N Ma (6024_CR45) 2022; 154
6024_CR47
F Lotte (6024_CR7) 2015; 103
6024_CR49
6024_CR48
W Hang (6024_CR33) 2019; 7
H Zhao (6024_CR32) 2020; 32
Z Wan (6024_CR11) 2021; 421
RT Schirrmeister (6024_CR36) 2017; 38
JR Wolpaw (6024_CR1) 2002; 113
A Gretton (6024_CR43) 2012; 25
6024_CR41
Y Chen (6024_CR12) 2020; 14
P Zanini (6024_CR15) 2017; 65
Y Song (6024_CR34) 2023; 31
H Ramoser (6024_CR25) 2000; 8
W Hang (6024_CR46) 2020; 193
N Lu (6024_CR38) 2016; 25
Z Lan (6024_CR30) 2018; 11
KK Ang (6024_CR2) 2016; 25
B He (6024_CR5) 2015; 103
C Chen (6024_CR44) 2019; 33
6024_CR24
6024_CR26
6024_CR20
M Grosse-Wentrup (6024_CR3) 2011; 8
F Fahimi (6024_CR21) 2019; 16
H Kang (6024_CR16) 2009; 16
ER Heremans (6024_CR51) 2022; 19
M Long (6024_CR42) 2018; 41
SM Saqib (6024_CR10) 2024; 10
M Krauledat (6024_CR6) 2006; 19
C Xu (6024_CR35) 2025; 261
I Haq (6024_CR4) 2022; 12
X Hong (6024_CR31) 2021; 29
M Ahn (6024_CR8) 2015; 243
References_xml – volume: 261
  start-page: 125452
  year: 2025
  ident: 6024_CR35
  publication-title: Expert Syst Appl.
  doi: 10.1016/j.eswa.2024.125452
– volume: 65
  start-page: 1107
  issue: 5
  year: 2017
  ident: 6024_CR15
  publication-title: IEEE Trans Biomed Eng.
  doi: 10.1109/TBME.2017.2742541
– volume: 29
  start-page: 556
  year: 2021
  ident: 6024_CR31
  publication-title: IEEE Trans Neural Syst Rehabilit Eng.
  doi: 10.1109/TNSRE.2021.3059166
– volume: 27
  start-page: 31
  issue: 1
  year: 2018
  ident: 6024_CR39
  publication-title: IEEE Trans Neural Syst Rehabilit Eng.
  doi: 10.1109/TNSRE.2018.2884641
– volume: 15
  start-page: 056013
  issue: 5
  year: 2018
  ident: 6024_CR37
  publication-title: J Neural Eng.
  doi: 10.1088/1741-2552/aace8c
– volume: 421
  start-page: 1
  year: 2021
  ident: 6024_CR11
  publication-title: Neurocomputing
  doi: 10.1016/j.neucom.2020.09.017
– ident: 6024_CR48
  doi: 10.1109/CVPR.2014.183
– volume: 103
  start-page: 871
  issue: 6
  year: 2015
  ident: 6024_CR7
  publication-title: Proc IEEE
  doi: 10.1109/JPROC.2015.2404941
– volume: 113
  start-page: 767
  issue: 6
  year: 2002
  ident: 6024_CR1
  publication-title: Clin Neurophys.
  doi: 10.1016/S1388-2457(02)00057-3
– volume: 11
  start-page: 20
  issue: 1
  year: 2016
  ident: 6024_CR9
  publication-title: IEEE Computat Intell Magaz.
  doi: 10.1109/MCI.2015.2501545
– ident: 6024_CR24
– ident: 6024_CR14
  doi: 10.1109/IJCNN.2016.7727726
– volume: 58
  start-page: 587
  issue: 3
  year: 2010
  ident: 6024_CR28
  publication-title: IEEE Transactions on Biomedical Engineering
  doi: 10.1109/TBME.2010.2093133
– volume: 7
  start-page: 128273
  year: 2019
  ident: 6024_CR33
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2019.2939288
– volume: 82
  start-page: 109
  year: 2012
  ident: 6024_CR23
  publication-title: Neurocomputing
  doi: 10.1016/j.neucom.2011.10.024
– volume: 193
  start-page: 105466
  year: 2020
  ident: 6024_CR46
  publication-title: Comput Methods Progr Biomed.
  doi: 10.1016/j.cmpb.2020.105466
– volume: 11
  start-page: 85
  issue: 1
  year: 2018
  ident: 6024_CR30
  publication-title: IEEE Trans Cognit. Develop. Syst.
  doi: 10.1109/TCDS.2018.2826840
– ident: 6024_CR41
  doi: 10.1109/IJCNN.2008.4634130
– volume: 16
  start-page: 683
  issue: 8
  year: 2009
  ident: 6024_CR16
  publication-title: IEEE Signal Proc Lett
  doi: 10.1109/LSP.2009.2022557
– volume: 16
  start-page: 026007
  issue: 2
  year: 2019
  ident: 6024_CR21
  publication-title: J Neural Eng.
  doi: 10.1088/1741-2552/aaf3f6
– ident: 6024_CR53
  doi: 10.1109/CVPR52729.2023.00729
– ident: 6024_CR49
– volume: 31
  start-page: 1258
  year: 2023
  ident: 6024_CR52
  publication-title: IEEE Trans Neural Syst Rehabilit Eng.
  doi: 10.1109/TNSRE.2023.3243257
– volume: 27
  start-page: 1352
  issue: 7
  year: 2019
  ident: 6024_CR22
  publication-title: IEEE Trans Neural Syst Rehabilit Eng.
  doi: 10.1109/TNSRE.2019.2923315
– volume: 10
  start-page: 10
  issue: 17
  year: 2024
  ident: 6024_CR10
  publication-title: Heliyon
  doi: 10.1016/j.heliyon.2024.e36759
– volume: 25
  start-page: 10245
  year: 2012
  ident: 6024_CR43
  publication-title: Adv Neural Inf Process Syst.
– volume: 7
  start-page: 50
  year: 2013
  ident: 6024_CR17
  publication-title: IEEE Rev Biomed Eng
  doi: 10.1109/RBME.2013.2290621
– volume: 25
  start-page: 392
  issue: 4
  year: 2016
  ident: 6024_CR2
  publication-title: IEEE Trans Neural Syst Rehabilit Eng.
  doi: 10.1109/TNSRE.2016.2646763
– ident: 6024_CR19
  doi: 10.1109/IWW-BCI.2019.8737340
– volume: 14
  start-page: 606949
  year: 2020
  ident: 6024_CR12
  publication-title: Front Neurosci.
  doi: 10.3389/fnins.2020.606949
– ident: 6024_CR20
  doi: 10.1109/NER.2017.8008420
– volume: 67
  start-page: 399
  issue: 2
  year: 2019
  ident: 6024_CR29
  publication-title: IEEE Trans Biomed Eng.
  doi: 10.1109/TBME.2019.2913914
– ident: 6024_CR26
  doi: 10.1109/IEMBS.2011.6091042
– volume: 12
  start-page: 12614
  issue: 24
  year: 2022
  ident: 6024_CR4
  publication-title: Appl Sci.
  doi: 10.3390/app122412614
– volume: 8
  start-page: 025004
  issue: 2
  year: 2011
  ident: 6024_CR3
  publication-title: J Neural Eng.
  doi: 10.1088/1741-2560/8/2/025004
– volume: 41
  start-page: 3071
  issue: 12
  year: 2018
  ident: 6024_CR42
  publication-title: IEEE Trans Patt Anal Mach Intell.
  doi: 10.1109/TPAMI.2018.2868685
– volume: 31
  start-page: 2767
  year: 2023
  ident: 6024_CR34
  publication-title: IEEE Trans Neural Syst Rehabilit Eng.
  doi: 10.1109/TNSRE.2023.3285309
– volume: 25
  start-page: 566
  issue: 6
  year: 2016
  ident: 6024_CR38
  publication-title: IEEE Trans Neural Syst Rehabilit Eng.
  doi: 10.1109/TNSRE.2016.2601240
– volume: 32
  start-page: 535
  issue: 2
  year: 2020
  ident: 6024_CR32
  publication-title: IEEE Trans Neural Netw Learn Syst.
  doi: 10.1109/TNNLS.2020.3010780
– ident: 6024_CR54
  doi: 10.1109/TBME.2023.3303289
– ident: 6024_CR55
– ident: 6024_CR47
  doi: 10.1007/978-3-319-26561-2_8
– ident: 6024_CR13
– volume: 8
  start-page: 441
  issue: 4
  year: 2000
  ident: 6024_CR25
  publication-title: IEEE Trans Rehabilitat Eng
  doi: 10.1109/86.895946
– volume: 38
  start-page: 5391
  issue: 11
  year: 2017
  ident: 6024_CR36
  publication-title: Human Brain Mapping
  doi: 10.1002/hbm.23730
– volume: 19
  start-page: 036044
  issue: 3
  year: 2022
  ident: 6024_CR51
  publication-title: J Neural Eng.
  doi: 10.1088/1741-2552/ac6ca8
– volume: 29
  start-page: 5619
  issue: 11
  year: 2018
  ident: 6024_CR40
  publication-title: IEEE Trans Neural Netw Learn Syst.
  doi: 10.1109/TNNLS.2018.2789927
– volume: 154
  start-page: 270
  year: 2022
  ident: 6024_CR45
  publication-title: Neural Netw.
  doi: 10.1016/j.neunet.2022.07.011
– volume: 12
  start-page: 0175856
  issue: 4
  year: 2017
  ident: 6024_CR27
  publication-title: PloS one
  doi: 10.1371/journal.pone.0175856
– volume: 60
  start-page: 2289
  issue: 8
  year: 2013
  ident: 6024_CR18
  publication-title: IEEE Trans Biomed Eng.
  doi: 10.1109/TBME.2013.2253608
– ident: 6024_CR50
  doi: 10.1007/978-3-319-49409-8_35
– volume: 19
  start-page: 1023
  year: 2006
  ident: 6024_CR6
  publication-title: Adv Neural Inf Proc Syst.
– volume: 33
  start-page: 3296
  year: 2019
  ident: 6024_CR44
  publication-title: Proc AAAI Conf Artif Intell.
– volume: 243
  start-page: 103
  year: 2015
  ident: 6024_CR8
  publication-title: J Neurosci Methods
  doi: 10.1016/j.jneumeth.2015.01.033
– volume: 103
  start-page: 907
  issue: 6
  year: 2015
  ident: 6024_CR5
  publication-title: Proc IEEE
  doi: 10.1109/JPROC.2015.2407272
SSID ssj0017805
Score 2.459312
Snippet The collection of substantial amounts of electroencephalogram (EEG) data is typically time-consuming and labor-intensive, which adversely impacts the...
Background: The collection of substantial amounts of electroencephalogram (EEG) data is typically time-consuming and labor-intensive, which adversely impacts...
Background:The collection of substantial amounts of electroencephalogram (EEG) data is typically time-consuming and labor-intensive, which adversely impacts...
Abstract Background: The collection of substantial amounts of electroencephalogram (EEG) data is typically time-consuming and labor-intensive, which adversely...
SourceID doaj
pubmedcentral
proquest
gale
pubmed
crossref
SourceType Open Website
Open Access Repository
Aggregation Database
Index Database
StartPage 393
SubjectTerms Adaptation
Adaptive sampling
Algorithms
Brain-Computer Interfaces
Calibration
Classification
Clusters
Datasets
Decoders
Decoding
Deep Learning
Discriminative feature learning
Domain adaptation
EEG
Effectiveness
Electroencephalogram
Electroencephalography
Electroencephalography - methods
Electronic data processing
Entropy minimization
Euclidean space
Humans
Machine learning
Mental task performance
Methods
Motor imagery
Motor skill learning
Motor task performance
Performance evaluation
Regularization
Reinforcement learning (Machine learning)
Representations
Signal Processing, Computer-Assisted
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Nb9QwELVQJSQuCCgfKQUFhMQBWY0_4jjHBW0pCDgAlXqz7MRTuGRXza6q_vvOOMlqIw5cetnDeiIlb2y_mcTzhrF3oQAlmwhchDJy7b3mQQTBW2MANMTWWCpO_v7DnJ3rrxflxV6rLzoTNsgDD8CdlD56b5H3IlK_EuAlWOGtpa7yIdqGdl_kvCmZGr8fkFL_VCJjzUkvSKeNIx_xwtDv9YyGklr_v3vyHinND0zuMdDpI_ZwDB3zxXDLj9m92D1h94dmkjeH7Nui9WvavPI2xnUOMUl25km1cqow6vKxS8RljsFqnu6N99tAL2Py5fIzXtqsiM2esvPT5e9PZ3zslcAbzPA2XEkLEcA00ArMSpSprcfYrDQWaSp4HYy20legW08vgpWKGKqZwtYFeqNAcJ-xg27VxRcsl7UGbwA5rY7axqquKzDeVy2oVgZZZuzDBJ1bD5IYLqUS1rgBaIcQuwS0u87YR0J3Z0ly1ukPdLIbnez-5-SMvSXfOBKs6OhEzKXf9r378uunW1iZSh6lytj70QhW6KXGjwUG-FSkcTWzPJ5Z4opq5sPTFHDjiu6dEiSMI4WqMvZmN0xX0im1Lq62yYbARfrI2PNhxuyeG-M-jcFkkTE7m0szYOYj3d8_Se9bCGMN5pVHdwHlS_ZA0gpIWpXH7GBztY2vMK7ahNdpCd0CNmYexQ
  priority: 102
  providerName: Directory of Open Access Journals
– databaseName: ProQuest Technology Collection
  dbid: 8FG
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1Lb9QwELagCIkL4k1KQQEhcUBW40cc54QWtNuCgANQqTfLTuyFS7JtdlXx75lxnKUREpcc4omUzIz9jZ2Zbwh57YogeOMDZa70VForqWOO0VapEGTwrdJYnPzlqzo9k5_Oy_N04DaktMppTYwLdds3eEZ-LBgSk3AmqnebC4pdo_DvamqhcZPcYoA0mNKlVyf7vwjI1z8Vymh1PDBka6OASrRQeL2agVHk7P93Zb4GTfO0yWs4tLpH7qYAMl-MFr9PbvjuAbk9tpT8_ZB8XrR2g0tY3nq_yYOPxJ155K6c6oy6PPWKWOcQsubx3eiwc3gkky-XJ_Bo0yOmPSJnq-WPD6c0dUygDezztlRwHXwIqgktg72JULW2EKGVSgNYOSudkprbKsjW4nGwEB4CNlXougCbFMyLx-Sg6zv_lOS8lsGqAMhWe6l9VddVUNZWbRAtd7zMyNtJdWYzEmOYuKHQyoyKNqBiExVtrjLyHrW7l0RS63ijv1ybNEdMab21GkIcD1GeYMHyoJnVGuxYOq-bjLxC2xikregwL2Ztd8NgPn7_ZhbgGVj4yEVG3iSh0IOVGpvKDOCrkOlqJnk0k4R51cyHJxcwaV4P5q8XZuTlfhifxFy1zve7KIPKBRDJyJPRY_bfDdGfhJCyyIie-dJMMfOR7tfPyPrNmNIKdpeH_3-vZ-QOR9-OXJRH5GB7ufPPIW7auhdxcvwB5LwWIw
  priority: 102
  providerName: ProQuest
Title Adaptive deep feature representation learning for cross-subject EEG decoding
URI https://www.ncbi.nlm.nih.gov/pubmed/39741250
https://www.proquest.com/docview/3152682137
https://www.proquest.com/docview/3150523111
https://pubmed.ncbi.nlm.nih.gov/PMC11686875
https://doaj.org/article/5aeaa8741e32431fa2f81a881785be8c
Volume 25
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3db9MwED_tQ0i8IL6XMaqAkHhAhvgjjvOAUIfajYpNaKNS3ywnsQsSSrt-aOy_5-wmZRF74CWV4kuUnO9yv3N9vwN4UySOs9I6QovUEmGMIAUtKKmkdE44W0nli5PPzuXpWIwm6WQH2nZHjQKXd6Z2vp_UePHr_e-rm0_o8B-Dwyv5YUk9CxvBaEMS6Y_Xu7CPkSnzHQ3OxN9_FTx_f6g2yijBVCdti2juvEcnUAU-_3-_2rfCVndL5a0YNXwIDxpwGfc31vAIdmz9GO5t2k3ePIGv_crM_ectrqydx84GUs848Fq2NUh13PSRmMYIZ-PwbGS5LvxyTTwYnOCl5czHu6cwHg6-fz4lTTcFUmIOuCKcKWedk6WrKOYtXObKIHpLpcJAVhhRSKGYyZyojF8q5twimJOJyhOcr4Ra_gz26lltDyBmuXBGOox6uRXKZnmeOWlMVjlesYKlEbxrVafnG9IMHZINJfVG0RpVrIOi9XUEx167W0lPeB1OzBZT3fiPTo01RiH8sYgAOXWGOUWNUjinaWFVGcFrPzfaU1rUfs_M1KyXS_3l8kL3FQtFkYxH8LYRcjOcpdI0JQj4Vp4FqyN51JFEnyu7w60J6NZkNaeeOodRnkXwajvsr_T72Go7WwcZr1wMMBE831jM9r0RGQqEm0kEqmNLHcV0R-qfPwIjOKVSScw8D_9HCy_gPvMWHtgqj2BvtVjbl4isVkUPdrNJhkc1POnBfr8_uhzh7_Hg_NtFL6xW9IJD_QFQrSNh
linkProvider Scholars Portal
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZKEYIL4k2gQEAgDsjq-hGvc0Bogd3u0m0P0Eq9GSexFy7J0uxq1T_Fb2TGSZZGSNx6ySGeRM54PPPZ8XxDyOts4AXPnacsSxyV1kqasYzRQinvpXeF0picfHSspqfyy1lytkN-d7kweKyy84nBURdVjnvk-4IhMQlnYvhh-Yti1Sj8u9qV0GjM4tBdbGDJVr-ffYbxfcP5ZHzyaUrbqgI0h7XQigquvfNe5b5ggN-FSrUFFJMoDQ49szJTUnM79LKwuGUqhANQowY6HUC_B8wJeO81cl0KiOSYmT452P61wPoAXWKOVvs1Q3Y4ClGQwgvguukFv1Aj4N9IcCkU9o9pXop7kzvkdgtY41FjYXfJjivvkRtNCcuL-2Q-KuwSXWZcOLeMvQtEoXHgyuzymsq4rU2xiAEix6FvtF5nuAUUj8cH8GheYQx9QE6vRJcPyW5Zle4xiXkqvVUeImnqpHbDNB16Ze2w8KLgGU8i8q5TnVk2RBwmLGC0Mo2iDajYBEWbTUQ-ona3kkiiHW5U5wvTzkmTWGetBkjlAFUK5i33mlmtYRyTzOk8Iq9wbAzSZJR4Dmdh13VtZt--mhFYIiZachGRt62Qr2CUctumNcBXIbNWT3KvJwnzOO83dyZgWj9Sm79WH5GX22Z8Es_Gla5aBxlULgStiDxqLGb73WCjEiDsICK6Z0s9xfRbyp8_Ass4Y0orWM0--X-_XpCb05OjuZnPjg-fklsc7TzwYO6R3dX52j0DzLbKnoeJEpPvVz0z_wAYglCn
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Adaptive+deep+feature+representation+learning+for+cross-subject+EEG+decoding&rft.jtitle=BMC+bioinformatics&rft.au=Liang%2C+Shuang&rft.au=Li%2C+Linzhe&rft.au=Zu%2C+Wei&rft.au=Feng%2C+Wei&rft.date=2024-12-31&rft.pub=BioMed+Central+Ltd&rft.issn=1471-2105&rft.eissn=1471-2105&rft.volume=25&rft.issue=1&rft_id=info:doi/10.1186%2Fs12859-024-06024-w&rft.externalDBID=ISR&rft.externalDocID=A821956823
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-2105&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-2105&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-2105&client=summon