Abstract
The authors of the present paper previously introduced a fast approximation framework for the graph edit distance problem. The basic idea of this approximation is to build a square cost matrix Cā=ā(c ij ), where each entry c ij 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 is established in polynomial time. Yet, this procedure considers the graph structure only in a local way, and thus, an overestimation of the true graph edit distance has to be accepted. The present paper aims at reducing this overestimation by means of an additional greedy search strategy that builds upon the initial assignment. In an experimental evaluation on three real world data sets we empirically verify a substantial gain of distance accuracy while run time is nearly not affected.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. Journal of Pattern Recognition and Artificial IntelligenceĀ 18(3), 265ā298 (2004)
Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. Journal of Pattern Recognition and Art. Intelligence Online Ready (2014)
Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics (Part B)Ā 13(3), 353ā363 (1983)
Bunke, H., Allermann, G.: Inexact graph matching for structural pattern recognition. Pattern Recognition LettersĀ 1, 245ā253 (1983)
Ambauen, R., Fischer, S., Bunke, H.: Graph edit distance with node splitting and merging and its application to diatom identification. In: Hancock, E., Vento, M. (eds.) GbRPR 2003. 95ā106, vol.Ā 2726, pp. 95ā106. Springer, Heidelberg (2003)
Robles-Kelly, A., Hancock, E.: Graph edit distance from spectral seriation. IEEE Transactions on Pattern Analysis and Machine IntelligenceĀ 27(3), 365ā378 (2005)
Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems, Science, and CyberneticsĀ 4(2), 100ā107 (1968)
Boeres, M.C., Ribeiro, C.C., Bloch, I.: A randomized heuristic for scene recognition by graph matching. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.Ā 3059, pp. 100ā113. Springer, Heidelberg (2004)
Sorlin, S., Solnon, C.: Reactive tabu search for measuring graph similarity. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol.Ā 3434, pp. 172ā182. Springer, Heidelberg (2005)
Justice, D., Hero, A.: A binary linear programming formulation of the graph edit distance. IEEE Trans. on Pattern Analysis ans Machine IntelligenceĀ 28(8), 1200ā1214 (2006)
Neuhaus, M., Riesen, K., Bunke, H.: Fast suboptimal algorithms for the computation of graph edit distance. In: Yeung, D.-Y., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds.) SSPR 2006 and SPR 2006. LNCS, vol.Ā 4109, pp. 163ā172. Springer, Heidelberg (2006)
Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision ComputingĀ 27(4), 950ā959 (2009)
Riesen, K., Dornberger, R., Bunke, H.: Iterative bipartite graph edit distance approximation. Accepted for Publication in Proc.Ā 11th IAPR Int.Ā Workshop on Document Analysis Systems
Riesen, K., Fischer, A., Bunke, H.: Improving approximate graph edit distance using genetic algorithms. Accepted for Publication in Proc.Ā IAPR Joint Int.Ā Workshop on S+SSPR
Munkres, J.: Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied MathematicsĀ 5(1), 32ā38 (1957)
Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) S+SSPR 2008. LNCS, vol.Ā 5342, pp. 287ā297. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Riesen, K., Bunke, H. (2014). Improving Approximate Graph Edit Distance by Means of a Greedy Swap Strategy. In: Elmoataz, A., Lezoray, O., Nouboud, F., Mammass, D. (eds) Image and Signal Processing. ICISP 2014. Lecture Notes in Computer Science, vol 8509. Springer, Cham. https://doi.org/10.1007/978-3-319-07998-1_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-07998-1_36
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07997-4
Online ISBN: 978-3-319-07998-1
eBook Packages: Computer ScienceComputer Science (R0)