Approximating Graph Edit Distance using GNCCP

Approximation de la distance d'édition de graphes en utilisant GNCCP

Benoît Gaüzère (1, 2) , Sébastien Bougleux (3) , Luc Brun (3)

1 LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes
2 DocApp - LITIS - Equipe Apprentissage
3 Equipe Image - Laboratoire GREYC - UMR6072

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.

Domaines: Vision par ordinateur et reconnaissance de formes [cs.CV]

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. pp.496--506. ⟨hal-01418936⟩