Bayesian Functional Connectivity and Graph Convolutional Network for Working Memory Load Classification

TL;DR

This paper presents a novel Bayesian approach to estimate EEG functional connectivity and uses graph convolutional networks to classify working memory loads with high accuracy, outperforming existing methods.

Contribution

It introduces a Bayesian structure learning algorithm for EEG connectivity and applies GCNs for working memory load classification, achieving state-of-the-art results.

Findings

Achieved up to 96% subject-specific classification accuracy.

Alpha and theta bands outperform beta in classification accuracy.

Bayesian connectivity estimation outperforms other methods.

Abstract

Brain responses related to working memory originate from distinct brain areas and oscillate at different frequencies. EEG signals with high temporal correlation can effectively capture these responses. Therefore, estimating the functional connectivity of EEG for working memory protocols in different frequency bands plays a significant role in analyzing the brain dynamics with increasing memory and cognitive loads, which remains largely unexplored. The present study introduces a Bayesian structure learning algorithm to learn the functional connectivity of EEG in sensor space. Next, the functional connectivity graphs are taken as input to the graph convolutional network to classify the working memory loads. The intrasubject (subject-specific) classification performed on 154 subjects for six different verbal working memory loads produced the highest classification accuracy of 96% and average classification accuracy of 89%, outperforming state-of-the-art classification models proposed in the literature. Furthermore, the proposed Bayesian structure learning algorithm is compared with state-of-the-art functional connectivity estimation methods through intersubject and intrasubject statistical analysis of variance. The results also show that the alpha and theta bands have better classification accuracy than the beta band.