This paper describes a group-level analysis of 14 subjects with prefrontal cortex (pFC) lesions and 20 healthy controls performing multiple lateralized visuospatial working memory (WM) trials. Using effective brain connectivity measures inferred from directed information (DI) during memory encoding, we first show that DI features can correctly classify 18 control subjects and 11 subjects with pFC lesions, providing an overall accuracy of 85.3%. Second, we show that differential DI, the change in DI during the encoding phase from pretrial, can successfully overcome inter-subject variability and correctly identify the class of all 34 subjects (100% accuracy). These accuracy results are based on two-thirds majority thresholding among all trials. Finally, we use Welch’s t-test to identify the crucial differences in the two classes’ sub-networks responsible for memory encoding. While the inflow of information to the prefrontal region is significant among subjects with pFC lesions, the outflow from the prefrontal to the frontal and central regions is diminished compared to the control subjects. We further identify specific neural pathways that are exclusively activated for each group during the encoding phase.
more »
« less
This content will become publicly available on April 24, 2024
Classifying Subjects with PFC Lesions from Healthy Controls during Working Memory Encoding via Graph Convolutional Networks
This paper describes a group-level classification of 14 patients with prefrontal cortex (pFC) lesions from 20 healthy controls using multi-layer graph convolutional networks (GCN) with features inferred from the scalp EEG recorded from the encoding phase of working memory (WM) trials. We first construct undirected and directed graphs to represent the WM encoding for each trial for each subject using distance correlation- based functional connectivity measures and differential directed information-based effective connectivity measures, respectively. Centrality measures of betweenness centrality, eigenvector centrality, and closeness centrality are inferred for each of the 64 channels from the brain connectivity. Along with the three centrality measures, each graph uses the relative band powers in the five frequency bands - delta, theta, alpha, beta, and gamma- as node features. The summarized graph representation is learned using two layers of GCN followed by mean pooling, and fully connected layers are used for classification. The final class label for a subject is decided using majority voting based on the results from all the subject's trials. The GCN-based model can correctly classify 28 of the 34 subjects (82.35% accuracy) with undirected edges represented by functional connectivity measure of distance correlation and classify all 34 subjects (100% accuracy) with directed edges characterized by effective connectivity measure of differential directed information.
more »
« less
- Award ID(s):
- 1954749
- NSF-PAR ID:
- 10414730
- Date Published:
- Journal Name:
- 2023 11th International IEEE/EMBS Conference on Neural Engineering (NER)
- Page Range / eLocation ID:
- 1 to 4
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Objective: Inferring causal or effective connectivity between measured timeseries is crucial to understanding directed interactions in complex systems. This task is especially challenging in the brain as the underlying dynamics are not well-understood. This paper aims to introduce a novel causality measure called frequency-domain convergent cross-mapping (FDCCM) that utilizes frequency-domain dynamics through nonlinear state-space reconstruction. Method: Using synthesized chaotic timeseries, we investigate general applicability of FDCCM at different causal strengths and noise levels. We also apply our method on two resting-state Parkinson's datasets with 31 and 54 subjects, respectively. To this end, we construct causal networks, extract network features, and perform machine learning analysis to distinguish Parkinson's disease patients (PD) from age and gender-matched healthy controls (HC). Specifically, we use the FDCCM networks to compute the betweenness centrality of the network nodes, which act as features for the classification models. Result: The analysis on simulated data showed that FDCCM is resilient to additive Gaussian noise, making it suitable for real-world applications. Our proposed method also decodes scalp-EEG signals to classify the PD and HC groups with approximately 97% leave-one-subject-out cross-validation accuracy. We compared decoders from six cortical regions to find that features derived from the left temporal lobe lead to a higher classification accuracy of 84.5% compared to other regions. Moreover, when the classifier trained using FDCCM networks from one dataset was tested on an independent out-of-sample dataset, it attained an accuracy of 84%. This accuracy is significantly higher than correlational networks (45.2%) and CCM networks (54.84%). Significance: These findings suggest that our spectral-based causality measure can improve classification performance and reveal useful network biomarkers of Parkinson's disease.more » « less
-
null (Ed.)Prior papers have explored the functional connectivity changes for patients suffering from major depressive disorder (MDD). This paper introduces an approach for classifying adolescents suffering from MDD using resting-state fMRI. Accurate diagnosis of MDD involves interviews with adolescent patients and their parents, symptom rating scales based on Diagnostic and Statistical Manual of Mental Disorders (DSM), behavioral observation as well as the experience of a clinician. Discovering predictive biomarkers for diagnosing MDD patients using functional magnetic resonance imaging (fMRI) scans can assist the clinicians in their diagnostic assessments. This paper investigates various static and dynamic connectivity measures extracted from resting-state fMRI for assisting with MDD diagnosis. First, absolute Pearson correlation matrices from 85 brain regions are computed and they are used to calculate static features for predicting MDD. A predictive sub-network extracted using sub-graph entropy classifies adolescent MDD vs. typical healthy controls with high accuracy, sensitivity and specificity. Next, approaches utilizing dynamic connectivity are employed to extract tensor based, independent component based and principal component based subject specific attributes. Finally, features from static and dynamic approaches are combined to create a feature vector for classification. A leave-one-out cross-validation method is used for the final predictor performance. Out of 49 adolescents with MDD and 33 matched healthy controls, a support vector machine (SVM) classifier using a radial basis function (RBF) kernel using differential sub-graph entropy combined with dynamic connectivity features classifies MDD vs. healthy controls with an accuracy of 0.82 for leave-one-out cross-validation. This classifier has specificity and sensitivity of 0.79 and 0.84, respectively. This performance demonstrates the utility of MRI based diagnosis of psychiatric disorders like MDD using a combination of static and dynamic functional connectivity features of the brain.more » « less
-
This paper analyzes the scalp electroencephalogram (EEG) recorded from 14 human subjects with pFC lesions and 20 healthy controls while performing lateral visuospatial working memory tasks to identify the directional brain networks responsible for memory encoding. First, we show that effective connectivity features using directed information (DI) are more accurate and robust than the functional connectivity measure of correlation coefficients in classifying the memory encoding stage from the pretrial phase, with a mean accuracy of 99.36%. Second, we identify the functional segregation of memory encoding to a much smaller sub-network by showing that the top 2.5% of the observed DI features can distinguish memory encoding from the pretrial phase with a mean accuracy of 93.1%. Finally, using graph features, we reveal the increased significance of frontocentral, centroparietal, and temporal regions in memory encoding for subjects with pFC lesions and reduced information flow in the prefrontal, frontal and parietooccipital areas when compared to healthy control.more » « less
-
Markov Chain Monte Carlo (MCMC) has been the de facto technique for sampling and inference of large graphs such as online social networks. At the heart of MCMC lies the ability to construct an ergodic Markov chain that attains any given stationary distribution \pi, often in the form of random walks or crawling agents on the graph. Most of the works around MCMC, however, presume that the graph is undirected or has reciprocal edges, and become inapplicable when the graph is directed and non-reciprocal. Here we develop a similar framework for directed graphs called Non- Markovian Monte Carlo (NMMC) by establishing a mapping to convert \pi into the quasi-stationary distribution of a carefully constructed transient Markov chain on an extended state space. As applications, we demonstrate how to achieve any given distribution \pi on a directed graph and estimate the eigenvector centrality using a set of non-Markovian, history-dependent random walks on the same graph in a distributed manner.We also provide numerical results on various real-world directed graphs to confirm our theoretical findings, and present several practical enhancements to make our NMMC method ready for practical use inmost directed graphs. To the best of our knowledge, the proposed NMMC framework for directed graphs is the first of its kind, unlocking all the limitations set by the standard MCMC methods for undirected graphs.more » « less
