Abstract
Graph Edit Distance is the most widely used measure of similarity between attributed graphs. Given a pair of graphs, it obtains a value of their similarity and also a path that transforms one graph into the other through edit operations. This path can be expressed as a labelling between nodes of both graphs. Important parameters of this measure are the costs of edit operations. In this article, we present new properties of the Graph Edit Distance and we show that its minimization lead to a few different labellings and so, most of the labellings in the labelling space cannot be obtained. Moreover, we present a method that using some of the new properties of the Graph Edit Distance speeds up the computation of all possible labellings.
This research is supported by Consolider Ingenio 2010: project CSD2007-00018, by the CICYT project DPI 2007-61452 and by the Universitat Rovira i Virgili through a PhD research grant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sanfeliu, A., Fu, K.: A Distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics 13(3), 353–362 (1983)
Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters 19(3-4), 255–259 (1998)
Shapiro, L., Haralick, R.M.: A metric for comparing relational descriptions. IEEE Transactions on Pattern Analysis and Machine Intelligence 7, 90–94 (1985)
Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vision Comput. 27(7), 950–959 (2009)
Neuhaus, M., Bunke, H.: Bridging the Gap Between Graph Edit Distance and Kernel Machines. Ser. in Machine Perception and Art. Intelligence, ISBN 9812708170 (2007)
Conte, D., Guidobaldi, C., Sansone, C.: A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs. In: Hancock, E., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726, pp. 130–141. Springer, Heidelberg (2003)
Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Analysis & Applications 13(1), 113–129 (2010)
Neuhaus, M., Bunke, H.: Automatic learning of costs functions for graph edit distance. Information Sciences 177(1), 239–247 (2007)
Toselli, A.H., Romero, V., Pastor, M., Vidal, E.: Multimodal interactive transcription of text images. Pattern Recognition 43(5), 1814–1825 (2010)
Serratosa, F., Solé-Ribalta, A., Cortés, X.: Automatic Learning of Edit Costs based on Interactive & Adaptive Graph Recognition. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol. 6658, pp. 152–163. Springer, Heidelberg (2011)
Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 18(4), 377–388 (1996)
Wong, A.K.C., et al.: Entropy and distance of random graphs with application to structural pattern recognition. IEEE T. on Pat. An. and Mach. Intell. 7, 599–609 (1985)
Rice, S.V., Bunke, H., Nartker, T.A.: Classes of cost functions for string edit distance. Algorithmica 18(2), 271–280 (1997)
Bunke, H.: Error Correcting Graph Matching: On the Influence of the Underlying Cost Function. IEEE TPAMI 21(9), 917–922 (1999)
Grünbaum, B.: Convex Polytopes, 2nd edn. ISBN 0387404090 (2003)
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
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Solé-Ribalta, A., Serratosa, F. (2011). Exploration of the Labelling Space Given Graph Edit Distance Costs. In: Jiang, X., Ferrer, M., Torsello, A. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2011. Lecture Notes in Computer Science, vol 6658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20844-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-20844-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20843-0
Online ISBN: 978-3-642-20844-7
eBook Packages: Computer ScienceComputer Science (R0)