A Graph Representation and Similarity Measure for Brain Networks with Nodal Features

The human brain demonstrates a network structure that is commonly represented using graphs with pseudonym connectome. Traditionally, connectomes encode only inter-regional connectivity as edges, while regional information, such as centrality of a node that may be crucial to the analysis, is usually handled as statistical covariates. This results in an incomplete encoding of valuable information. In order to alleviate such problems, we propose an enriched connectome encoding regional properties of the brain network, such as structural node degree, strength, and centrality, as node features in addition to representing structural connectivity between regions as weighted edges. We further present an efficient graph matching algorithm, providing two measures to quantify similarity between enriched connectomes. We demonstrate the utility of our graph representation and similarity measures on classifying a traumatic brain injury dataset. Our results show that the enriched representation combining nodal features and structural connectivity information with the graph matching based similarity measures is able to differentiate the groups better than the traditional connectome representation.

[1]  M. V. D. Heuvel,et al.  Exploring the brain network: A review on resting-state fMRI functional connectivity , 2010, European Neuropsychopharmacology.

[2]  Anders M. Dale,et al.  An automated labeling system for subdividing the human cerebral cortex on MRI scans into gyral based regions of interest , 2006, NeuroImage.

[3]  Michael Weiner,et al.  Network-level analysis of cortical thickness of the epileptic brain , 2010, NeuroImage.

[4]  Dimitri Van De Ville,et al.  Decoding brain states from fMRI connectivity graphs , 2011, NeuroImage.

[5]  Mark E. J. Newman,et al.  Structure and inference in annotated networks , 2015, Nature Communications.

[6]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[7]  Olaf Sporns,et al.  Complex network measures of brain connectivity: Uses and interpretations , 2010, NeuroImage.

[8]  O. Sporns,et al.  Complex brain networks: graph theoretical analysis of structural and functional systems , 2009, Nature Reviews Neuroscience.

[9]  Marisa O. Hollinshead,et al.  The organization of the human cerebral cortex estimated by intrinsic functional connectivity. , 2011, Journal of neurophysiology.

[10]  Vince Lyzinski,et al.  A joint graph inference case study: the C. elegans chemical and electrical connectomes , 2015, Worm.

[11]  Jean-Yves Ramel,et al.  A parallel graph edit distance algorithm , 2018, Expert Syst. Appl..

[12]  Kaspar Riesen,et al.  Bipartite Graph Matching for Computing the Edit Distance of Graphs , 2007, GbRPR.

[13]  S. Petersen,et al.  Brain Networks and Cognitive Architectures , 2015, Neuron.

[14]  Ragini Verma,et al.  Unifying Inference of Meso-Scale Structures in Networks , 2015, PloS one.

[15]  Santiago Ontañón,et al.  Efficient approximation of labeling problems with applications to immune repertoire analysis , 2016, 2016 23rd International Conference on Pattern Recognition (ICPR).

[16]  Éva Tardos,et al.  Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 2002, JACM.