Improving Graph Edit Distance Approximation by Centrality Measures

In recent years the authors of the present paper introduced a powerful approximation fra or the graph edit distance problem. The basic idea of this approximation is to build a square cost matrix C = (cj), where each entry reflects the cost of a node substitution, deletion or insertion plus the matching cost arising from the local edge structure. Based on C an optimal assignment of the nodes and their local structure can be established in polynomial time (using, for instance, the Hungarian algorithm). Since this approach considers the local -- rather than the global -- structural properties of the graphs only, the obtained graph edit distance value is suboptimal in the sense of overestimating the true edit distance in general. The present paper pursues the idea of including topological information in the node labels in order to increase the amount of structural information available during the initial assignment process. In an experimental evaluation on three real world data sets a reduction of the overestimation can be observed while the run time is only moderately increased compared to our original framework.

[1]  L. da F. Costa,et al.  Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.

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

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

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

[5]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

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

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

[8]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[9]  Jon Kleinberg,et al.  Authoritative sources in a hyperlinked environment , 1999, SODA '98.

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

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

[12]  Horst Bunke,et al.  A Unified Framework for Strengthening Topological Node Features and Its Application to Subgraph Isomorphism Detection , 2013, GbRPR.

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

[14]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[15]  P. Bonacich Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

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

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

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

[19]  Horst Bunke,et al.  A Graph Matching Based Approach to Fingerprint Classification Using Directional Variance , 2005, AVBPA.

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