Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks - GREYC image Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks

Résumé

The definition of efficient similarity or dissimilarity measures between graphs is a key problem in structural pattern recognition. This problem is nicely addressed by the graph edit distance, which constitutes one of the most flexible graph dissimilarity measure in this field. Unfortunately, the computation of an exact graph edit distance is known to be exponential in the number of nodes. In the early beginning of this decade, an efficient heuristic based on a bipartite assignment algorithm has been proposed to find efficiently a suboptimal solution. This heuristic based on an optimal matching of nodes' neighborhood provides a good approximation of the exact edit distance for graphs with a large number of different labels and a high density. Unfortunately, this heuristic gworks poorly on unlabeled graphs or graphs with a poor diversity of neighborhoods. In this work we propose to extend this heuristic by considering a mapping of bags of walks centered on each node of both graphs.
Fichier principal
Vignette du fichier
ssspr2014_submission_59.pdf (645.16 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01066384 , version 1 (19-09-2014)

Identifiants

  • HAL Id : hal-01066384 , version 1

Citer

Benoit Gaüzère, Sébastien Bougleux, Kaspar Riesen, Luc Brun. Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks. Structural, Syntactic, and Statistical Pattern Recognition (S+SSPR),, Aug 2014, Joensuu, Finland. pp.73-82. ⟨hal-01066384⟩
115 Consultations
439 Téléchargements

Partager

Gmail Facebook X LinkedIn More