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.
KeywordsAnnotated brain networks Brain graphs Multi-feature representation Graph matching
This work was funded by NIH grants R01HD089390-01A1, 1 R01 NS096606, 5R01NS092398, and 5R01NS065980.
- 6.Chen, L., Vogelstein, J.T., Lyzinski, V., Priebe, C.E.: A joint graph inference case study: the C. elegans chemical and electrical connectomes. In: Worm, vol. 5, p. e1142041. Taylor & Francis (2016)Google Scholar
- 7.Fishkind, D.E., Adali, S., Priebe, C.E.: Seeded Graph Matching. arXiv preprint, arXiv:1209.0367v1 (2012)
- 9.Ktena, S.I., Parisot, S., Passerat-Palmbach, J.: Comparison of Brain Networks with Unknown Correspondences. arXiv preprint arXiv:1611.04783, October 2016
- 14.Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard Problems, pp. 144–191. PWS Publishing Co., Boston (1997)Google Scholar
- 15.Osmanlıoğlu, Y., Ontañón, S., Hershberg, U., Shokoufandeh, A.: Efficient approximation of labeling problems with applications to immune repertoire analysis. In: 2016 23rd International Conference on Pattern Recognition (ICPR), pp. 2410–2415. IEEE (2016)Google Scholar