Decoding EEG Signals with Visibility Graphs to Predict Varying Levels of Mental Workload

Arya Teymourlouei, R. Gentili, J. Reggia
{"title":"Decoding EEG Signals with Visibility Graphs to Predict Varying Levels of Mental Workload","authors":"Arya Teymourlouei, R. Gentili, J. Reggia","doi":"10.1109/CISS56502.2023.10089662","DOIUrl":null,"url":null,"abstract":"Recent work in predicting mental workload through EEG analysis has centered around features in the frequency domain. However, these features alone may not be enough to accurately predict mental workload. We propose a graph-based approach that filters EEG channels into five frequency bands. The time series data for each band is transformed into two types of visibility graphs. The natural visibility graph and horizontal visibility graph algorithms are used. Six graph-based features are then calculated which seek to distinguish between EEGs of low and high mental workload. Feature selection is evaluated with statistical tests. The features are fed as input data to two machine learning algorithms which are random forest and neural network. The accuracy of the random forest method is 90%, and the neural network has 86% accuracy. The graphical analysis showed that higher frequency ranges (alpha, beta, gamma) had a stronger ability to classify levels of mental workload. Unexpectedly, the natural visibility graph algorithm had better overall performance. Using the method presented here, accurate classification of MWL using EEG signals can enable the development of robust BCI.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS56502.2023.10089662","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Recent work in predicting mental workload through EEG analysis has centered around features in the frequency domain. However, these features alone may not be enough to accurately predict mental workload. We propose a graph-based approach that filters EEG channels into five frequency bands. The time series data for each band is transformed into two types of visibility graphs. The natural visibility graph and horizontal visibility graph algorithms are used. Six graph-based features are then calculated which seek to distinguish between EEGs of low and high mental workload. Feature selection is evaluated with statistical tests. The features are fed as input data to two machine learning algorithms which are random forest and neural network. The accuracy of the random forest method is 90%, and the neural network has 86% accuracy. The graphical analysis showed that higher frequency ranges (alpha, beta, gamma) had a stronger ability to classify levels of mental workload. Unexpectedly, the natural visibility graph algorithm had better overall performance. Using the method presented here, accurate classification of MWL using EEG signals can enable the development of robust BCI.
用可见性图解码脑电图信号以预测不同程度的脑力负荷
最近通过脑电图分析预测脑力负荷的工作主要集中在频域特征上。然而,仅凭这些特征可能不足以准确预测精神工作量。我们提出了一种基于图的方法,将EEG通道过滤到五个频段。每个波段的时间序列数据被转换成两种可见性图。采用了自然可见性图和水平可见性图算法。然后计算出六个基于图的特征,以区分低脑力负荷和高脑力负荷的脑电图。特征选择通过统计测试进行评估。将特征作为输入数据馈送到随机森林和神经网络两种机器学习算法中。随机森林方法的准确率为90%,神经网络的准确率为86%。图形分析表明,较高的频率范围(α, β, γ)具有更强的分类精神负荷水平的能力。出乎意料的是,自然可见性图算法具有更好的综合性能。利用本文提出的方法,利用脑电信号对MWL进行准确分类,可以实现鲁棒脑机接口的发展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信