New binary linear programming formulation to compute the graph edit distance

Abstract In this paper, a new binary linear programming formulation for computing the exact Graph Edit Distance (GED) between two graphs is proposed. A fundamental strength of the formulations lies in their genericity since the GED can be computed between directed or undirected fully attributed graphs. Moreover, a continuous relaxation of the domain constraints in the formulation provides an efficient lower bound approximation of the GED. A complete experimental study that compares the proposed formulations with six state-of-the-art algorithms is provided. By considering both the accuracy of the proposed solution and the efficiency of the algorithms as performance criteria, the results show that none of the compared methods dominate the others in the Pareto sense. In general, our formulation converges faster to optimality while being able to scale up to match the largest graphs in our experiments. The relaxed formulation leads to an accurate approach that is 12% more accurate than the best approximate method of our benchmark.

[1]  G. Nemhauser,et al.  Integer Programming , 2020 .

[2]  Kaspar Riesen,et al.  Towards the unification of structural and statistical pattern recognition , 2012, Pattern Recognit. Lett..

[3]  Mario Vento,et al.  Graph Embedding for Pattern Recognition , 2010, ICPR Contests.

[4]  Kaspar Riesen,et al.  Approximate graph edit distance computation by means of bipartite graph matching , 2009, Image Vis. Comput..

[5]  R. Saigal.  Linear Programming: A Modern Integrated Analysis , 1995 .

[6]  Salih O. Duffuaa,et al.  A Linear Programming Approach for the Weighted Graph Matching Problem , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[8]  Edwin R. Hancock,et al.  Graph Characterization via Ihara Coefficients , 2011, IEEE Transactions on Neural Networks.

[9]  Benoit Gaüzère,et al.  Two new graphs kernels in chemoinformatics , 2012, Pattern Recognit. Lett..

[10]  Alfred O. Hero,et al.  A binary linear programming formulation of the graph edit distance , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Horst Bunke,et al.  Inexact graph matching for structural pattern recognition , 1983, Pattern Recognit. Lett..

[12]  Alfred M. Bruckstein,et al.  Graph Isomorphisms and Automorphisms via Spectral Signatures , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Alexander J. Smola,et al.  Learning Graph Matching , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Romain Raveaux,et al.  A graph matching method and a graph matching distance based on subgraph assignments , 2010, Pattern Recognit. Lett..

[15]  Anthony K. H. Tung,et al.  Comparing Stars: On Approximating Graph Edit Distance , 2009, Proc. VLDB Endow..

[16]  Kaspar Riesen,et al.  Graph Classification and Clustering Based on Vector Space Embedding , 2010, Series in Machine Perception and Artificial Intelligence.

[17]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[18]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Kaspar Riesen,et al.  Suboptimal Graph Isomorphism using bipartite Matching , 2012, Int. J. Pattern Recognit. Artif. Intell..

[20]  Horst Bunke,et al.  Bridging the Gap between Graph Edit Distance and Kernel Machines , 2007, Series in Machine Perception and Artificial Intelligence.

[21]  Kaspar Riesen,et al.  Fast Suboptimal Algorithms for the Computation of Graph Edit Distance , 2006, SSPR/SPR.

[22]  Edwin R. Hancock,et al.  Bayesian graph edit distance , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[23]  Francesc Serratosa,et al.  Learning graph-matching edit-costs based on the optimality of the oracle's node correspondences , 2015, Pattern Recognit. Lett..

[24]  Kaspar Riesen,et al.  IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning , 2008, SSPR/SPR.

[25]  Kaspar Riesen,et al.  Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic , 2007, MLG.

[26]  Yvon Savaria,et al.  A Hausdorff Heuristic for Efficient Computation of Graph Edit Distance , 2014, S+SSPR.

[27]  Thomas Gärtner,et al.  Kernels for structured data , 2008, Series in Machine Perception and Artificial Intelligence.

[28]  Volkmar Frinken,et al.  Approximation of graph edit distance based on Hausdorff matching , 2015, Pattern Recognit..

[29]  Orestis Kostakis,et al.  Classy: fast clustering streams of call-graphs , 2014, Data Mining and Knowledge Discovery.

[30]  Jean-Yves Ramel,et al.  Vector Representation of Graphs: Application to the Classification of Symbols and Letters , 2009, 2009 10th International Conference on Document Analysis and Recognition.

[31]  Luc De Raedt,et al.  Feature Construction with Version Spaces for Biochemical Applications , 2001, ICML.

[32]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[33]  Horst Bunke,et al.  Character prototype selection for handwriting recognition in historical documents , 2011, 2011 19th European Signal Processing Conference.

[34]  Horst Bunke,et al.  On a relation between graph edit distance and maximum common subgraph , 1997, Pattern Recognit. Lett..

[35]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[37]  Xuelong Li,et al.  A survey of graph edit distance , 2010, Pattern Analysis and Applications.

[38]  Kaspar Riesen,et al.  Improving bipartite graph edit distance approximation using various search strategies , 2015, Pattern Recognit..

[39]  Sébastien Adam,et al.  Datasets for the Evaluation of Substitution-Tolerant Subgraph Isomorphism , 2013, GREC.

[40]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[41]  Francesc Serratosa,et al.  Computation of graph edit distance: Reasoning about optimality and speed-up , 2015, Image Vis. Comput..

[42]  Kaspar Riesen,et al.  Graph Embedding in Vector Spaces by Means of Prototype Selection , 2007, GbRPR.

[43]  Francesc Serratosa,et al.  Fast computation of Bipartite graph matching , 2014, Pattern Recognit. Lett..

[44]  Kaspar Riesen,et al.  Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications , 2016 .

[45]  Horst Bunke,et al.  Matching of Hypergraphs - Algorithms, Applications, and Experiments , 2008, Applied Pattern Recognition.