Error-Tolerant Geometric Graph Similarity

Graph matching is the task of computing the similarity between two graphs. Error-tolerant graph matching is a type of graph matching, in which a similarity between two graphs is computed based on some tolerance value whereas within exact graph matching a strict one-to-one correspondence is required between two graphs. In this paper, we present an approach to error-tolerant graph similarity using geometric graphs. We define the vertex distance (dissimilarity) and edge distance between two graphs and combine them to compute graph distance.

[1]  Naama Brenner,et al.  Exploratory adaptation in large random networks , 2016, Nature Communications.

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

[3]  George Karypis,et al.  Discovering frequent geometric subgraphs , 2007, Inf. Syst..

[4]  David Haussler,et al.  Convolution kernels on discrete structures , 1999 .

[5]  Pascal Fua,et al.  Geometric Graph Matching Using Monte Carlo Tree Search , 2017, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Terry Caelli,et al.  Inexact Graph Matching Using Eigen-Subspace Projection Clustering , 2004, Int. J. Pattern Recognit. Artif. Intell..

[7]  Joachim Gudmundsson,et al.  Measuring the Similarity of Geometric Graphs , 2009, SEA.

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

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

[10]  Horst Bunke.  Error-Tolerant Graph Matching: A Formal Framework and Algorithms , 1998, SSPR/SPR.

[11]  Mario Vento,et al.  Graph Matching and Learning in Pattern Recognition in the Last 10 Years , 2014, Int. J. Pattern Recognit. Artif. Intell..

[12]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

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

[14]  Panos M. Pardalos,et al.  Quantification of network structural dissimilarities , 2017, Nature Communications.

[15]  Ravi Shankar Singh,et al.  Error-tolerant graph matching using homeomorphism , 2017, 2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI).

[16]  Kazuyuki Aihara,et al.  Graph distance for complex networks , 2016, Scientific Reports.

[17]  E. Fukusaki,et al.  Corrigendum: New Insight into the Role of the Calvin Cycle: Reutilization of CO2 Emitted through Sugar Degradation , 2016, Scientific Reports.

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

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

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

[21]  John D. Lafferty,et al.  Diffusion Kernels on Statistical Manifolds , 2005, J. Mach. Learn. Res..

[22]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

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

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

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

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

[27]  Michael Gertz,et al.  Geometric graph matching and similarity: a probabilistic approach , 2014, SSDBM '14.

[28]  Ali Shokoufandeh,et al.  Indexing hierarchical structures using graph spectra , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.