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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [17 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01418936
Contributor : Luc Brun <>
Submitted on : Saturday, December 17, 2016 - 8:13:15 PM
Last modification on : Tuesday, April 2, 2019 - 1:34:12 AM

File

sspr2016.pdf
Files produced by the author(s)

Identifiers

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

Share

Metrics

Record views

143

Files downloads

147