Sub-optimal Graph Matching by Node-to-node Assignment Classification - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2019

Sub-optimal Graph Matching by Node-to-node Assignment Classification

Résumé

In the recent years, Graph Edit Distance has awaken interest in the scientific community and some new graph-matching algorithms that compute it have been presented. Nevertheless, these algorithms usually cannot be used in real applications due to runtime restrictions. For this reason, other graph-matching algorithms have also been used that compute an approximation of the graph correspondence with lower run-time. Clearly, in a real application, there is a tradeoff between runtime and accuracy. One of the most costly part in these algorithms is the deduction of the node-to-node mapping. We present a new graph-matching algorithm that returns a graph correspondence without the explicit computation of the assignment problem. This is done thanks to a classification of the node-to-node assignment learned in a previous training stage.
Fichier principal
Vignette du fichier
2019GbRGEDLearning.pdf (432.25 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02285797 , version 1 (13-09-2019)

Identifiants

Citer

Xavier Cortés, Donatello Conte, Francesc Serratosa. Sub-optimal Graph Matching by Node-to-node Assignment Classification. Donatello Conte; Jean-Yves Ramel; Pasquale Foggia. Graph-Based Representations in Pattern Recognition, 11510, Springer, pp.35-44, 2019, Lecture Notes in Computer Science, 978-3-030-20080-0. ⟨10.1007/978-3-030-20081-7_4⟩. ⟨hal-02285797⟩
49 Consultations
239 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More