.png){kind=icon}
.png){kind=icon}
Return
Error-tolerant approximate graph matching utilizing node centrality information
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2020.03.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph matching is the task of finding the similarity between the two graphs. Error-tolerant graph matching is the process of computing the similarity between the two graphs, where some flexibility to noise or error is allowed to approximate the value of graph matching. In this paper, we present a framework for graph matching by utilizing the centrality measures to ignore the least central nodes of the graphs. Experimental evaluation shows that this approach can be useful to reduce the overall matching time and it can provide time versus accuracy trade-off. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Centrality measures
Graph edit distance
Graph matching
Structural pattern recognition
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.3
Papers:
7.9K
Citations:
1.6W