Approximating Graph Edit Distance using GNCCP

Abstract : The graph edit distance (GED) is a flexible and widely used dissimilarity measure between graphs. Computing the GED between two graphs can be performed by solving a quadratic assignment problem (QAP). However, the problem is NP complete hence forbidding the computation of the optimal GED on large graphs. To tackle this drawback, recent heuristics are based on a linear approximation of the initial QAP formulation. In this paper, we propose a method providing a better local minimum of the QAP formulation than our previous proposition based on IPFP. We adapt a convex concave regularization scheme initially designed for graph matching which allows to reach better local minimum and avoids the need of an initialization step. Several experiments demonstrate that our method outperforms previous methods in terms of accuracy , with a time still much lower than the computation of a GED.
Type de document :
Communication dans un congrès
Structural, Syntactic, and Statistical Pattern Recognition, Nov 2016, Mérida, Mexico. LNCS, 10029, pp.496--506, 2016, Structural, Syntactic, and Statistical Pattern Recognition - Joint IAPR International Workshop, S+SSPR 2016, Mérida,. 〈http://link.springer.com/book/10.1007/978-3-319-49055-7〉
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01418936
Contributeur : Luc Brun <>
Soumis le : samedi 17 décembre 2016 - 20:13:15
Dernière modification le : jeudi 7 février 2019 - 16:45:54

Fichier

sspr2016.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01418936, version 1

Citation

Benoît Gaüzère, Sébastien Bougleux, Luc Brun. Approximating Graph Edit Distance using GNCCP. Structural, Syntactic, and Statistical Pattern Recognition, Nov 2016, Mérida, Mexico. LNCS, 10029, pp.496--506, 2016, Structural, Syntactic, and Statistical Pattern Recognition - Joint IAPR International Workshop, S+SSPR 2016, Mérida,. 〈http://link.springer.com/book/10.1007/978-3-319-49055-7〉. 〈hal-01418936〉

Partager

Métriques

Consultations de la notice

139

Téléchargements de fichiers

140