Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance
Graph edit distance corresponds to a flexible graph dissimilarity measure. Unfortunately, its computation requires an exponential complexity according to the number of nodes of both graphs being compared. Some heuristics based on bipartite assignment algorithms have been proposed in order to approximate the graph edit distance. However, these heuristics lack of accuracy since they are based either on small patterns providing a too local information or walks whose tottering induce some bias in the edit distance calculus. In this work, we propose to extend previous heuristics by considering both less local and more accurate patterns using subgraphs defined around each node.
KeywordsEdit Distance Direct Neighbourhood Heuristic Function Edit Operation Optimal Assignment
Unable to display preview. Download preview PDF.
- 2.Foggia, P., Percannella, G., Vento, M.: Graph Matching and Learning in Pattern Recognition on the last ten years. Journal of Pattern Recognition and Artificial Intelligence 28(1) (2014)Google Scholar
- 8.Ramon, J., Gärtner, T.: Expressivity versus efficiency of graph kernels. In: First International Workshop on Mining Graphs, Trees and Sequences, pp. 65–74 (2003)Google Scholar