A Novel Software Toolkit for Graph Edit Distance Computation

Graph edit distance is one of the most flexible mechanisms for error-tolerant graph matching. Its key advantage is that edit distance is applicable to unconstrained attributed graphs and can be tailored to a wide variety of applications by means of specific edit cost functions. The computational complexity of graph edit distance, however, is exponential in the number of nodes, which makes it feasible for small graphs only. In recent years the authors of the present paper introduced several powerful approximations for fast suboptimal graph edit distance computation. The contribution of the present work is a self standing software tool integrating these suboptimal graph matching algorithms. It is about being made publicly available. The idea of this software tool is that the powerful and flexible algorithmic framework for graph edit distance computation can easily be adapted to specific problem domains via a versatile graphical user interface. The aim of the present paper is twofold. First, it reviews the implemented approximation methods and second, it thoroughly describes the features and application of the novel graph matching software.

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

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

[3]  Bernhard Schölkopf,et al.  Learning with kernels , 2001 .

[4]  Mario Vento,et al.  An Improved Algorithm for Matching Large Graphs , 2001 .

[5]  Klaus Jansen,et al.  Experimental and Efficient Algorithms , 2003, Lecture Notes in Computer Science.

[6]  Edwin R. Hancock,et al.  Spectral embedding of graphs , 2003, Pattern Recognit..

[7]  Horst Bunke,et al.  Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Idenfication , 2003, GbRPR.

[8]  Nello Cristianini,et al.  Kernel Methods for Pattern Analysis , 2003, ICTAI.

[9]  Horst Bunke,et al.  An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification , 2004, SSPR/SPR.

[10]  Richard C. Wilson,et al.  Levenshtein distance for graph spectral features , 2004, ICPR 2004.

[11]  Celso C. Ribeiro,et al.  A Randomized Heuristic for Scene Recognition by Graph Matching , 2004, WEA.

[12]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[13]  Bernard Haasdonk,et al.  Feature space interpretation of SVMs with indefinite kernels , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Christine Solnon,et al.  Reactive Tabu Search for Measuring Graph Similarity , 2005, GbRPR.

[15]  Antonio Robles-Kelly,et al.  Graph edit distance from spectral seriation , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

[17]  Gábor Csárdi,et al.  The igraph software package for complex network research , 2006 .

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

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

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

[21]  Kaspar Riesen,et al.  Bipartite Graph Matching for Computing the Edit Distance of Graphs , 2007, GbRPR.

[22]  Kaspar Riesen,et al.  Efficient Suboptimal Graph Isomorphism , 2009, GbRPR.

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

[24]  Edwin R. Hancock,et al.  Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop, SSPR&SPR 2010, Cesme, Izmir, Turkey, August 18-20, 2010. Proceedings , 2010, SSPR/SPR.

[25]  Francisco Escolano,et al.  Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings , 2007, GbRPR.

[26]  Kaspar Riesen,et al.  Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching , 2011, GbRPR.