Skip to Main content Skip to Navigation
Conference papers

A novel algorithm for measuring graph similarity: application to brain networks

Abstract : measuring similarity among graphs is a challenging issue in many disciplines including neuroscience. Several algorithms, mainly based on vertices or edges properties, were proposed to address this issue. Most of them ignore the physical location of the vertices, which is a crucial factor in the analysis of brain networks. Indeed, functional brain networks are usually represented as graphs composed of vertices (brain regions) connected by edges (functional connectivity). In this paper, we propose a novel algorithm to measure a similarity between graphs. The novelty of our approach is to account for vertices, edges and spatiality at the same time. The proposed algorithm is evaluated using synthetic graphs. It shows high ability to detect and measure similarity between graphs. An application to real functional brain networks is then described. The algorithm allows for quantification of the inter-subjects variability during a picture naming task.
Document type :
Conference papers
Complete list of metadatas

https://hal-univ-rennes1.archives-ouvertes.fr/hal-01380111
Contributor : Laurent Jonchère <>
Submitted on : Wednesday, October 12, 2016 - 2:58:07 PM
Last modification on : Wednesday, June 24, 2020 - 4:19:30 PM

Identifiers

  • HAL Id : hal-01380111, version 1

Citation

Ahmad Mheich, M. Hassan, Vincent Gripon, M. Khalil, C. Berrou, et al.. A novel algorithm for measuring graph similarity: application to brain networks. 7th Annual International IEEE EMBS Conference on Neural Engineering (NER), Apr 2015, Montpellier, France. pp.1068--1071. ⟨hal-01380111⟩

Share

Metrics

Record views

320