Summary
Abstract-Graph edit distance (GED) is widely applied to similarity measurement of graphs in inexact graph matching. Due to the difficulty of defining cost functions reasonably, we do research on two GED algorithms without cost function definition: the first is combining edge direction histogram (EDH) and earth mover’s distance (EMD) to estimate the GED; the second is introducing hidden Markov model (HMM) and Kullback-Leibler distance (KLD) into GED algorithm. These algorithms are evaluated theoretically and experimentally, and are compared with the GED from spectral seriation, one of the leading methods for computing GED with cost functions. Theoretical comparison shows that the proposed two cost function free GED algorithms have less complexity and characterize graph structure more effectively than spectral seriation method. Experimental results on image classification demonstrate that time occupied by the EDH-based method is 4.4% that of the spectral seriation method with the same correct classification rate, and correct classification rate of HMM-based method is 3.4% greater than that of the other two methods with 3.3% the time consumed by spectral seriation method. Clustering rate of these three methods is basically the same, but HMM-based and EDH-based methods only consume 3.17% and 5.43% the time of spectral seriation method.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bunke, H.: Pattern Recognition Letters 18(8), 689–694 (1997)
Bunke, H.: IEEE Trans. Pattern Anal. Mach. Intell. 21(9), 917–922 (1999)
Bunke, H.: Proc. IEEE Int’l Conf. on Pattern Recognition, 117–124 (2000)
Caelli, T., Kosinov, S.: IEEE Trans. Pattern Anal. Mach. Intell. 26(4), 515–519 (2004)
Chen, G.H., Yang, C.L., Po, L.M., Xie, S.L.: Proc. IEEE Int’l Conf. Acoustics, Speech, and Signal Processing, pp. 933–936 (2006)
Cross, A.D.J., Wilson, R.C., Hancock, E.R.: Pattern Recognition 30(7), 953–970 (1997)
Figueiredo, M.A.T., Jain, A.K.: IEEE Trans. Pattern Anal. Mach. Intell. 24(3), 381–396 (2002)
Hofmann, T., Buhmann, J.M.: Proc. Conf. Neural information processing systems, pp. 459–466 (1994)
Jain, A., Dubes, R.: Algorithms for clustering data. Prentice-Hall, Englewood Cliffs (1988)
Kim, D.H., Yun, I.D., Lee, S.U.: Proc. the 17th Int’l Conf. Pattern Recognition, pp. 48–51 (2004)
Kim, Y.W., Oh, I.S.: Pattern Recognition Letters 25(11), 1243–1251 (2004)
Levenshtein, V.: Soviet Physics-Doklady 10(8), 707–710 (1966)
MacQueen, J.B.: Proc. 5-th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297 (1967)
Mahmoudi, F., Shanbehzadeh, J.: Pattern Recognition 36(8), 1725–1736 (2003)
Mitchell, T.M.: Machine Learning. UK McGraw Hill, Maidenhead (1997)
INRIA-MOVI houses, http://www.inria.fr/recherche/equipes/movi.en.html
Qian, H.: Physical Review E 63, 042103/1–042103/4 (2001)
Rabiner, L.R.: Proc. IEEE 77(2), 257–286 (1989)
Robles-Kelly, A., Hancock, E.R.: IEEE Trans. Pattern Anal. Mach. Intell. 27(3), 365–378 (2005)
Rubner, Y., Tomasi, C., Guibas, L.J.: Proc. IEEE Int’l Conf. Computer Vision, 59–66 (1998)
Umeyama, S.: IEEE Trans. Pattern Anal. Mach. Intell. 10(5), 695–703 (1988)
Vailaya, A., Jain, A., Zhang, H.J.: Proc. Workshop in Content-Based Access to Image and Video Libraries, pp. 3–8 (1998)
Vision and Autonomous Systems Center’s Image Database, http://vasc.ri.cmu.edu//idb/html/motion/house/index.html
Wagner, R.A., Fischer, M.J.: Journal of the ACM 21(1), 168–173 (1974)
Zhang, L., Allinson, N.M.: Proc. 5th Annual UK Workshop on Comp. Intelligence, pp. 137–142 (2005)
Xiao, B., Gao, X.B., Tao, D.C., Li, X.L.: International Journal of Imaging Systems and Technology 18(2-3), 209–218 (2008)
Gao, X.B., Xiao, B., Tao, D.C., Li, X.L.: Pattern Recognition 47(10), 3179–3191 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gao, X., Xiao, B., Tao, D., Li, X. (2009). A Comparative Study of Three Graph Edit Distance Algorithms. In: Abraham, A., Hassanien, AE., Snášel, V. (eds) Foundations of Computational Intelligence Volume 5. Studies in Computational Intelligence, vol 205. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01536-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-01536-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01535-9
Online ISBN: 978-3-642-01536-6
eBook Packages: EngineeringEngineering (R0)