International audienceQuantifying the similarity between two networks is critical in many applications. A number of algorithms have been proposed to compute graph similarity, mainly based on the properties of nodes and edges. Interestingly, most of these algorithms ignore the physical location of the nodes, which is a key factor in the context of brain networks involving spatially defined functional areas. In this paper, we present a novel algorithm called “SimiNet” for measuring similarity between two graphs whose nodes are defined a priori within a 3D coordinate system. SimiNet provides a quantified index (ranging from 0 to 1) that accounts for node, edge and spatiality features. Complex graphs were simulated to evaluate the performance o...
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 audienceMeasuring similarity among graphs is recognized as a non-trivial problem. Most...
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 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 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 audienceMeasuring similarity among graphs is recognized as a non-trivial problem. Most...
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 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 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 audienceMeasuring similarity among graphs is recognized as a non-trivial problem. Most...