skip to main content

Title: Learning Multi-resolution Graph Edge Embedding for Discovering Brain Network Dysfunction in Neurological Disorders
Tremendous recent literature show that associations between different brain regions, i.e., brain connectivity, provide early symptoms of neurological disorders. Despite significant efforts made for graph neural network (GNN) techniques, their focus on graph nodes makes the state-of-the-art GNN methods not suitable for classifying brain connectivity as graphs where the objective is to characterize disease-relevant network dysfunction patterns on graph links. To address this issue, we propose Multi-resolution Edge Network (MENET) to detect disease-specific connectomic benchmarks with high discrimination power across diagnostic categories. The core of MENET is a novel graph edge-wise transform that we propose, which allows us to capture multi-resolution “connectomic” features. Using a rich set of the connectomic features, we devise a graph learning framework to jointly select discriminative edges and assign diagnostic labels for graphs. Experiments on two real datasets show that MENET accurately predicts diagnostic labels and identify brain connectivities highly associated with neurological disorders such as Alzheimer’s Disease and Attention-Deficit/Hyperactivity Disorder.
; ; ;
Award ID(s):
1948510 2008602
Publication Date:
Journal Name:
Lecture notes in computer science
Page Range or eLocation-ID:
Sponsoring Org:
National Science Foundation
More Like this
  1. Graph Neural Networks (GNN) offer the powerful approach to node classification in complex networks across many domains including social media, E-commerce, and FinTech. However, recent studies show that GNNs are vulnerable to attacks aimed at adversely impacting their node classification performance. Existing studies of adversarial attacks on GNN focus primarily on manipulating the connectivity between existing nodes, a task that requires greater effort on the part of the attacker in real-world applications. In contrast, it is much more expedient on the part of the attacker to inject adversarial nodes, e.g., fake profiles with forged links, into existing graphs so asmore »to reduce the performance of the GNN in classifying existing nodes. Hence, we consider a novel form of node injection poisoning attacks on graph data. We model the key steps of a node injection attack, e.g., establishing links between the injected adversarial nodes and other nodes, choosing the label of an injected node, etc. by a Markov Decision Process. We propose a novel reinforcement learning method for Node Injection Poisoning Attacks (NIPA), to sequentially modify the labels and links of the injected nodes, without changing the connectivity between existing nodes. Specifically, we introduce a hierarchical Q-learning network to manipulate the labels of the adversarial nodes and their links with other nodes in the graph, and design an appropriate reward function to guide the reinforcement learning agent to reduce the node classification performance of GNN. The results of the experiments show that NIPA is consistently more effective than the baseline node injection attack methods for poisoning graph data on three benchmark datasets.« less
  2. Brain functional network connectivity is an important measure for characterizing changes in a variety of neurological disorders, for example Alzheimer’s Disease, Parkinson Disease, and Epilepsy. Epilepsy is a serious neurological disorder affecting more than 50 million persons worldwide with severe impact on the quality of life of patients and their family members due to recurrent seizures. More than 30% of epilepsy patients are refractive to pharmacotherapy and are considered for resection to disrupt epilepsy seizure networks. However, 20-50% of these patients continue to have seizures after surgery. Therefore, there is a critical need to gain new insights into the characteristicsmore »of epilepsy seizure networks involving one of more brain regions and accurately delineate epileptogenic zone as a target for surgery. Although there is growing availability of large volume of high resolution stereotactic electroencephalogram (SEEG) data recorded from intracranial electrodes during presurgical evaluation of patients, there are significant informatics challenges associated with processing and analyzing this large signal dataset for characterizing epilepsy seizure networks. In this paper, we describe the development and application of a high-performance indexing structure for efficient retrieval of large-scale SEEG signal data to compute seizure network patterns corresponding to brain functional connectivity networks. This novel Neuro-Integrative Connectivity (NIC) search and retrieval method has been developed by extending the red-black tree index model together with an efficient lookup algorithm. We systematically perform a comparative evaluation of the proposed NIC index using de-identified SEEG data from a patient with temporal lobe epilepsy to retrieve segments of signal data corresponding to multiple seizure events and demonstrate the significant advantages of the NIC index as compared to existing methods. This new NIC Index enables faster computation of brain functional connectivity measures in epilepsy patients for large-scale network analysis and potentially provide new insights into the organization as well as evolution of seizure networks in epilepsy patients.« less
  3. In this paper, we propose a supervised graph representation learning method to model the relationship between brain functional connectivity (FC) and structural connectivity (SC) through a graph encoder-decoder system. The graph convolutional network (GCN) model is leveraged in the encoder to learn lower-dimensional node representations (i.e. node embeddings) integrating information from both node attributes and network topology. In doing so, the encoder manages to capture both direct and indirect interactions between brain regions in the node embeddings which later help reconstruct empirical FC networks. From node embeddings, graph representations are learnt to embed the entire graphs into a vector space.more »Our end-to-end model utilizes a multi-objective loss function to simultaneously learn node representations for FC network reconstruction and graph representations for subject classification. The experiment on a large population of non-drinkers and heavy drinkers shows that our model can provide a characterization of the population pattern in the SC-FC relationship, while also learning features that capture individual uniqueness for subject classification. The identified key brain subnetworks show significant between-group difference and support the promising prospect of GCN-based graph representation learning on brain networks to model human brain activity and function.« less
  4. 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 fMRImore »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.« less
  5. Message passing Graph Neural Networks (GNNs) provide a powerful modeling framework for relational data. However, the expressive power of existing GNNs is upper-bounded by the 1-Weisfeiler-Lehman (1-WL) graph isomorphism test, which means GNNs that are not able to predict node clustering coefficients and shortest path distances, and cannot differentiate between different d regular graphs. Here we develop a class of message passing GNNs, named Identity-aware Graph Neural Networks (ID-GNNs), with greater expressive power than the 1-WL test. ID-GNN offers a minimal but powerful solution to limitations of existing GNNs. ID-GNN extends existing GNN architectures by inductively considering nodes’ identities duringmore »message passing. To embed a given node, IDGNN first extracts the ego network centered at the node, then conducts rounds of heterogeneous message passing, where different sets of parameters are applied to the center node than to other surrounding nodes in the ego network. We further propose a simplified but faster version of ID-GNN that injects node identity information as augmented node features. Altogether, both versions of ID GNN represent general extensions of message passing GNNs, where experiments show that transforming existing GNNs to ID-GNNs yields on average 40% accuracy improvement on challenging node, edge, and graph property prediction tasks; 3% accuracy improvement on node and graph classification benchmarks; and 15% ROC AUC improvement on real-world link prediction tasks. Additionally, ID-GNNs demonstrate improved or comparable performance over other task-specific graph networks.« less