An official website of the United States government
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
Seizure onset zone (SOZ) identification using effective brain connectivity of epileptogenic networks
Abstract Objective. To demonstrate the capability of utilizing graph feature-based supervised machine learning (ML) algorithm on intracranial electroencephalogram recordings for the identification of seizure onset zones (SOZs) in individuals with drug-resistant epilepsy.Approach. Utilizing three model-free measures of effective connectivity (EC)-directed information, mutual information-guided Granger causality index (MI-GCI), and frequency-domain convergent cross-mapping (FD-CCM) - directed graphs are generated. Graph centrality measures at different sparsity are used as the classifier’s features.Main results. The centrality features achieve high accuracies exceeding 90% in distinguishing SOZ electrodes from non-SOZ electrodes. Notably, a sparse graph representation with just ten features and simple ML models effectively achieves such performance. The study identifies FD-CCM centrality measures as particularly significant, with a mean AUC of 0.93, outperforming prior literature. The FD-CCM-based graph modeling also highlights elevated centrality measures among SOZ electrodes, emphasizing heightened activity relative to non-SOZ electrodes during ictogenesis.Significance. This research not only underscores the efficacy of automated SOZ identification but also illuminates the potential of specific EC measures in enhancing discriminative power within the context of epilepsy research.
more »
« less
- Award ID(s):
- 1954749
- PAR ID:
- 10517825
- Publisher / Repository:
- IOP Publishing
- Date Published:
- Journal Name:
- Journal of Neural Engineering
- Volume:
- 21
- Issue:
- 3
- ISSN:
- 1741-2560
- Format(s):
- Medium: X Size: Article No. 036053
- Size(s):
- Article No. 036053
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
2D layered metal-organic frameworks (MOFs) are a new class of multifunctional materials that can provide electrical conductivity on top of the conventional structural characteristics of MOFs, offering potential applications in electronics and optics. Here, for the first time, we employ Machine Learning (ML) techniques to predict the thermodynamic stability and electronic properties of layered electrically conductive (EC) MOFs, bypassing expensive ab initio calculations for the design and discovery of new materials. Proper feature engineering is a very important factor in utilizing ML models for such purposes. Here, we show that a combination of elemental features, using generic statistical reduction methods and crystal structure information curated from the recently introduced EC-MOF database, leads to a reasonable prediction of the thermodynamic and electronic properties of EC MOFs. We utilize these features in training a diverse range of ML classifiers and regressors. Evaluating the performance of these different models, we show that an ensemble learning approach in the form of stacking ML models can lead to higher accuracy and more reliability on the predictive power of ML to be employed in future MOF research.more » « less
-
This paper investigates scalp electroencephalogram (EEG) data from 14 subjects with unilateral prefrontal cortex (pFC) lesions and 20 healthy controls during lateral visuospatial working memory (WM) tasks. The goal is to differentiate the brain networks involved in WM processing between these groups. The EEG recordings are transformed into graph signals, with proximity-weighted brain connectivity measures as edges and centrality measures as nodal features. Graph convolutional network (GCN) layers are used for feature representation, followed by a fully connected layer for classification. The GCN-based model effectively handles nine classification tasks, proving that graph-based network representation is versatile for describing brain interactions. The sparse MI-GCI-based graph model’s accuracy effectively captures the functional segregation of distinct WM tasks. The classifier using mutual information-guided Granger causality index (MI-GCI) with 20% of top edges matched prior classification performance with 67% fewer parameters and 80% less graph density, identifying the correct class of all 34 subjects in group identification using leave-one-out cross-validation and two-thirds majority voting.more » « less
-
Measuring the importance of a node in a network is a major goal in the analysis of social networks, biological systems, transportation networks, and so forth. Differentcentralitymeasures have been proposed to capture the notion of node importance. For example, thecenterof a graph is a node that minimizes the maximum distance to any other node (the latter distance is theradiusof the graph). Themedianof a graph is a node that minimizes the sum of the distances to all other nodes. Informally, thebetweenness centralityof a nodewmeasures the fraction of shortest paths that havewas an intermediate node. Finally, thereach centralityof a nodewis the smallest distancersuch that anys-tshortest path passing throughwhas eithersortin the ball of radiusraroundw. The fastest known algorithms to compute the center and the median of a graph and to compute the betweenness or reach centrality even of a single node take roughly cubic time in the numbernof nodes in the input graph. It is open whether these problems admit truly subcubic algorithms, i.e., algorithms with running time Õ(n3-δ) for some constant δ > 0.1 We relate the complexity of the mentioned centrality problems to two classical problems for which no truly subcubic algorithm is known, namely All Pairs Shortest Paths (APSP) and Diameter. We show that Radius, Median, and Betweenness Centrality areequivalent under subcubic reductionsto APSP, i.e., that a truly subcubic algorithm for any of these problems implies a truly subcubic algorithm for all of them. We then show that Reach Centrality is equivalent to Diameter under subcubic reductions. The same holds for the problem of approximating Betweenness Centrality within any finite factor. Thus, the latter two centrality problems could potentially be solved in truly subcubic time, even if APSP required essentially cubic time. On the positive side, our reductions for Reach Centrality imply an improved Õ(Mnω)-time algorithm for this problem in case of non-negative integer weights upper bounded byM, where ω is a fast matrix multiplication exponent.more » « less
