Advertisement
Published in:
2015 | OriginalPaper | Chapter
Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance
Authors : Vincenzo Carletti, Benoit Gaüzère, Luc Brun, Mario Vento
Published in: Graph-Based Representations in Pattern Recognition
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.