Hidden Markov Support Vector Machines for Self-Paced Brain Computer Interfaces

H. Bashashati, R. Ward, A. Bashashati
{"title":"Hidden Markov Support Vector Machines for Self-Paced Brain Computer Interfaces","authors":"H. Bashashati, R. Ward, A. Bashashati","doi":"10.1109/ICMLA.2015.178","DOIUrl":null,"url":null,"abstract":"Brain Computer Interfaces (BCI) aim at providing a means to control devices with brain signals. Self-paced BCIs, as opposed to synchronous ones, have the advantage of being operational at all times and not only at specific system-defined periods. Traditionally, in the BCI field, a sliding window over the brain signal is used to detect the intention of the user at a given time. This approach ignores the temporal correlations between the adjacent time windows. This paper proposes a novel approach to classify self-paced BCI data using structural support vector machines. Our proposed approach considers the history of the brain signals in the context of sequential supervised learning to better detect the intention of the user from his/her brain signals. We have compared our proposed model to the sliding window approach with Support Vector Machines (SVM) and Linear Discriminant Analysis (LDA) classifiers. Using data collected from 4 individuals form BCI competition IV, it is shown that the F1 score of our approach is significantly better than the sliding window approach. The average F1 score of our method across all subjects is 0.3 and 0.5 higher than the sliding window with SVM and LDA classifiers, respectively.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLA.2015.178","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Brain Computer Interfaces (BCI) aim at providing a means to control devices with brain signals. Self-paced BCIs, as opposed to synchronous ones, have the advantage of being operational at all times and not only at specific system-defined periods. Traditionally, in the BCI field, a sliding window over the brain signal is used to detect the intention of the user at a given time. This approach ignores the temporal correlations between the adjacent time windows. This paper proposes a novel approach to classify self-paced BCI data using structural support vector machines. Our proposed approach considers the history of the brain signals in the context of sequential supervised learning to better detect the intention of the user from his/her brain signals. We have compared our proposed model to the sliding window approach with Support Vector Machines (SVM) and Linear Discriminant Analysis (LDA) classifiers. Using data collected from 4 individuals form BCI competition IV, it is shown that the F1 score of our approach is significantly better than the sliding window approach. The average F1 score of our method across all subjects is 0.3 and 0.5 higher than the sliding window with SVM and LDA classifiers, respectively.
自定步脑机接口的隐马尔可夫支持向量机
脑机接口(BCI)旨在提供一种用脑信号控制设备的方法。与同步的bci相反,自定节奏的bci具有在任何时候都可操作的优势,而不仅仅是在特定的系统定义的时间段。传统上,在脑机接口领域,在给定时间内,使用脑信号上的滑动窗口来检测用户的意图。这种方法忽略了相邻时间窗之间的时间相关性。本文提出了一种基于结构支持向量机的自定步脑机接口数据分类方法。我们提出的方法考虑了顺序监督学习背景下大脑信号的历史,以便更好地从用户的大脑信号中检测用户的意图。我们将我们提出的模型与滑动窗口方法与支持向量机(SVM)和线性判别分析(LDA)分类器进行了比较。使用BCI比赛IV中4个个体的数据表明,我们的方法的F1得分明显优于滑动窗口方法。我们的方法在所有科目上的平均F1分数分别比使用SVM和LDA分类器的滑动窗口高0.3和0.5。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信