.png){kind=icon}
.png){kind=icon}
Return
On efficient network similarity measures
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2019.06.035.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents novel graph similarity measures which can be applied to simple directed and undirected networks. To define the graph similarity measures, we first map graphs to real numbers by utilizing structural graph measures. Then, we define measures of similarity between real numbers and prove that they can be used as proxies for graph similarity. Numerical results are derived to show the domain coverage of these measures as well as their clustering ability. The latter relates to the efficient grouping of graphs according to certain structural properties. Our numerical results are sensitive to these properties and offer insights useful for designing effective graph similarity measures. (C) 2019 Published by Elsevier Inc.
Keywords:
Distance measures
Similarity measures
Inequalities
Graphs
Networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
View more organizations