Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance

Approximation de la distance d'édition entre graphes en combinant l'appariement biparti et l'appariement exact de sous structures

Résumé

Graph edit distance corresponds to a flexible graph dissim-ilarity 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 defined as subgraphs defined around each node.

Mots clés

Fichier principal
Vignette du fichier
Approximate_Graph_Edit_Distance_Computat.pdf (1.74 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01389626 , version 1 (28-10-2016)

Identifiants

Citer

Vincenzo Carletti, Benoit Gaüzère, Luc Brun, Mario Vento. Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance. Graph-Based Representation in Pattern Recognition, Cheng-Lin Liu ; Bin Luo; Walter G. Kropatsch; Jian Cheng, May 2015, Bejing, China. pp.188 - 197, ⟨10.1007/978-3-319-18224-7_19⟩. ⟨hal-01389626⟩
111 Consultations
604 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More