International audienceMeasuring similarity among graphs is recognized as a non-trivial problem. Most of the algorithms proposed so far ignore the spatial location of vertices, which is a crucial factor in the context of brain networks. In this paper, we present a novel algorithm, called "SimNet", for measuring the similarity between two graphs whose vertices represent the position of sources over the cortex. The novelty is to account for differences at the level of spatially-registered vertices and edges. Simulated graphs are used to evaluate the algorithm performance and to compare it with methods reported elsewhere. Results show that SimNet is able to quantify the similarity between two graphs under a spatial constraint based on the 3D lo...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceMeasuring similarity among graphs is recognized as a non-trivial problem. Most...
International audienceMeasuring similarity among graphs is recognized as a non-trivial problem. Most...
International audienceA very critical issue in many applications is how to compute graphs similarity...
International audienceA very critical issue in many applications is how to compute graphs similarity...
International audienceA very critical issue in many applications is how to compute graphs similarity...
International audienceA very critical issue in many applications is how to compute graphs similarity...
International audienceA very critical issue in many applications is how to compute graphs similarity...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceMeasuring similarity among graphs is recognized as a non-trivial problem. Most...
International audienceMeasuring similarity among graphs is recognized as a non-trivial problem. Most...
International audienceA very critical issue in many applications is how to compute graphs similarity...
International audienceA very critical issue in many applications is how to compute graphs similarity...
International audienceA very critical issue in many applications is how to compute graphs similarity...
International audienceA very critical issue in many applications is how to compute graphs similarity...
International audienceA very critical issue in many applications is how to compute graphs similarity...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...
International audienceQuantifying the similarity between two networks is critical in many applicatio...