Exact and Inexact Graph Matching: Methodology and Applications

Part of the Advances in Database Systems book series (ADBS, volume 40)

Abstract

Graphs provide us with a powerful and flexible representation formalism which can be employed in various fields of intelligent information processing. The process of evaluating the similarity of graphs is referred to as graph matching. Two approaches to this task exist, viz. exact and inexact graph matching. The former approach aims at finding a strict correspondence between two graphs to be matched, while the latter is able to cope with errors and measures the difference of two graphs in a broader sense. The present chapter reviews some fundamental concepts of both paradigms and shows two recent applications of graph matching in the fields of information retrieval and pattern recognition.

Keywords

Exact and Inexact Graph Matching Graph Edit Distance Information Retrieval by means of Graph Matching Graph Embedding via Graph Matching 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, 1974.Google Scholar
  2. [2]
    R. Ambauen, S. Fischer, and H. Bunke. Graph edit distance with node splitting and merging and its application to diatom identification. In E. Hancock and M. Vento, editors, Proc. 4th Int. Workshop on Graph Based Representations in Pattern Recognition, LNCS 2726, pages 95–106. Springer, 2003.Google Scholar
  3. [3]
    J.C. Bezdek and L. Kuncheva. Nearest prototype classifier designs: An experimental study. Int. Journal of Intelligent Systems, 16(12):1445–1473, 2001.MATHCrossRefGoogle Scholar
  4. [4]
    C. Bishop. Pattern Recognition and Machine Learning. Springer, 2008.Google Scholar
  5. [5]
    K. Borgwardt, C. Ong, S. Schonauer, S. Vishwanathan, A. Smola, and H.-P. Kriegel. Protein function prediction via graph kernels. Bioinformatics, 21(1):47–56, 2005.CrossRefGoogle Scholar
  6. [6]
    A. Brugger, H. Bunke, P. Dickinson, and K Riesen. Generalized graph matching for data mining and information retrieval. In P. Perner, editor, Advances in Data Mining. Medical Applications, E-Commerce, Marketing, and Theoretical Aspects, LNCS 5077, pages 298–312. Springer, 2008.Google Scholar
  7. [7]
    H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 18:689–694, 1997.CrossRefMathSciNetGoogle Scholar
  8. [8]
    H. Bunke and G. Allermann. Inexact graph matching for structural pattern recognition. Pattern Recognition Letters, 1:245–253, 1983.MATHCrossRefGoogle Scholar
  9. [9]
    H. Bunke, P.J. Dickinson, M. Kraetzl, and W.D. Wallis. A Graph-Theoretic Approach to Enterprise Network Dynamics, volume 24 of Progress in Computer Science and Applied Logic (PCS). Birkhauser, 2007.Google Scholar
  10. [10]
    H. Bunke, P. Foggia, C. Guidobaldi, C. Sansone, and M. Vento. A comparison of algorithms for maximum common subgraph on randomly connected graphs. In T. Caelli, A. Amin, R. Duin, M. Kamel, and D. de Ridder, editors, Structural, Syntactic, and Statistical Pattern Recognition, pages 85–106. Springer, 2002. LNCS 2396.Google Scholar
  11. [11]
    H. Bunke, X. Jiang, and A. Kandel. On the minimum common supergraph of two graphs. Computing, 65(1):13–25, 2000.MATHMathSciNetGoogle Scholar
  12. [12]
    H. Bunke and K. Shearer. A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 19(3):255–259, 1998.MATHCrossRefGoogle Scholar
  13. [13]
    T. Caelli and S. Kosinov. Inexact graph matching using eigen-subspace projection clustering. Int. Journal of Pattern Recognition and Artificial Intelligence, 18(3):329–355, 2004.CrossRefGoogle Scholar
  14. [14]
    W.J. Christmas, J. Kittler, and M. Petrou. Structural matching in computer vision using probabilistic relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(8):749–764, 1995.CrossRefGoogle Scholar
  15. [15]
    D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. Int. Journal of Pattern Recognition and Artificial Intelligence, 18(3):265–298, 2004.CrossRefGoogle Scholar
  16. [16]
    D. Cook and L. Holder, editors. Mining Graph Data. Wiley-Interscience, 2007.Google Scholar
  17. [17]
    L.P. Cordella, P. Foggia, C. Sansone, and M. Vento. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. on Pattern Analysis and Machine Intelligence, 26(20):1367–1372, 2004.CrossRefGoogle Scholar
  18. [18]
    P.J. Dickinson, H. Bunke, A. Dadej, and M. Kraetzl. Matching graphs with unique node labels. Pattern Analysis and Applications, 7(3):243–254, 2004.MathSciNetGoogle Scholar
  19. [19]
    R. Duda, P. Hart, and D. Stork. Pattern Classification. Wiley-Interscience, 2nd edition, 2000.Google Scholar
  20. [20]
    M.A. Eshera and K.S. Fu. A graph distance measure for image analysis. IEEE Transactions on Systems, Man, and Cybernetics (Part B), 14(3):398–408, 1984.MATHGoogle Scholar
  21. [21]
    M.-L. Fernandez and G. Valiente. A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters, 22(6–7):753–758, 2001.MATHCrossRefGoogle Scholar
  22. [22]
    M.A. Fischler and R.A. Elschlager. The representation and matching of pictorial structures. IEEE Trans. on Computers, 22(1):67–92, 1973.CrossRefGoogle Scholar
  23. [23]
    R.A. Fisher. The statistical utilization of multiple measurements. In Annals of Eugenics, volume 8, pages 376–386, 1938.Google Scholar
  24. [24]
    P. Frasconi, M. Gori, and A. Sperduti. A general framework for adaptive processing of data structures. IEEE Transactions on Neural Networks, 9(5):768–786, 1998.CrossRefGoogle Scholar
  25. [25]
    M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., 1979.Google Scholar
  26. [26]
    T. Gartner. Kernels for Structured Data. World Scientific, 2008.Google Scholar
  27. [27]
    T. Gartner, P. Flach, and S. Wrobel. On graph kernels: Hardness results and efficient alternatives. In B. Scholkopf and M. Warmuth, editors, Proc. 16th Annual Conf. on Learning Theory, pages 129–143, 2003.Google Scholar
  28. [28]
    S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(4):377–388, 1996.CrossRefGoogle Scholar
  29. [29]
    M. Gori, M. Maggini, and L. Sarti. Exact and approximate graph matching using random walks. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(7):1100–1111, 2005.CrossRefGoogle Scholar
  30. [30]
    E.R. Hancock and J. Kittler. Discrete relaxation. Pattern Recognition, 23(7):711–733, 1990.CrossRefGoogle Scholar
  31. [31]
    Z. Harchaoui and F. Bach. Image classification with segmentation graph kernels. In IEEE Conference on Computer Vision and Pattern Recognition, pages 1–8, 2007.Google Scholar
  32. [32]
    D. Haussler. Convolution kernels on discrete structures. Technical Report UCSC-CRL-99-10, University of California, Santa Cruz, 1999.Google Scholar
  33. [33]
    G. Hjaltason and H. Samet. Properties of embedding methods for similarity searching in metric spaces. IEEE Trans. on Pattern Analysis ans Machine Intelligence, 25(5):530–549, 2003.CrossRefGoogle Scholar
  34. [34]
    J.E. Hopcroft and J. Wong. Linear time algorithm for isomorphism of planar graphs. In Proc. 6th Annual ACM Symposium on Theory of Computing, pages 172–184, 1974.Google Scholar
  35. [35]
    B. Huet and E.R. Hancock. Shape recognition from large image libraries by inexact graph matching. Pattern Recognition Letters, 20(11–13):1259–1269, 1999.CrossRefGoogle Scholar
  36. [36]
    A. Jain and D. Zongker. Feature selection: Evaluation, application, and small sample performance. IEEE Trans. on Pattern Analysis and Machine Intelligence, 19(2):153–158, 1997.CrossRefGoogle Scholar
  37. [37]
    B. Jain and F. Wysotzki. Automorphism partitioning with neural networks. Neural Processing Letters, 17(2):205–215, 2003.MATHCrossRefGoogle Scholar
  38. [38]
    X. Jiang and H. Bunke. Optimal quadratic-time isomorphism of ordered graphs. Pattern Recognition, 32(17):1273–1283, 1999.CrossRefGoogle Scholar
  39. [39]
    I. Jolliffe. Principal Component Analysis. Springer, 1986.Google Scholar
  40. [40]
    D. Justice and A. Hero. A binary linear programming formulation of the graph edit distance. IEEE Trans. on Pattern Analysis ans Machine Intelligence, 28(8):1200–1214, 2006.CrossRefGoogle Scholar
  41. [41]
    J. Kittler and E.R. Hancock. Combining evidence in probabilistic relaxation. Int. Journal of Pattern Recognition and Art. Intelligence, 3(1):29–51, 1989.CrossRefGoogle Scholar
  42. [42]
    R.I. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete input spaces. In Proc. 19th Int. Conf. on Machine Learning, pages 315–322, 2002.Google Scholar
  43. [43]
    J. Larrosa and G. Valiente. Constraint satisfaction algorithms for graph pattern matching. Mathematical Structures in Computer Science, 12(4):403–422, 2002.MATHCrossRefMathSciNetGoogle Scholar
  44. [44]
    G. Levi. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 9:341–354, 1972.CrossRefMathSciNetGoogle Scholar
  45. [45]
    E.M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and Systems Sciences, 25:42–65, 1982.MATHCrossRefMathSciNetGoogle Scholar
  46. [46]
    B. Luo and E. Hancock. Structural graph matching using the EM algorithm and singular value decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(10):1120–1136, 2001.CrossRefGoogle Scholar
  47. [47]
    B. Luo, R. Wilson, and E.R. Hancock. Spectral embedding of graphs. Pattern Recognition, 36(10):2213–2223, 2003.MATHCrossRefGoogle Scholar
  48. [48]
    P. Mahe, N. Ueda, and T. Akutsu. Graph kernels for molecular structures – activity relationship analysis with support vector machines. Journal of Chemical Information and Modeling, 45(4):939–951, 2005.CrossRefGoogle Scholar
  49. [49]
    J.J. McGregor. Backtrack search algorithms and the maximal common subgraph problem. Software Practice and Experience, 12:23–34, 1982.MATHCrossRefGoogle Scholar
  50. [50]
    B.D. McKay. Practical graph isomorphism. Congressus Numerantium, 30:45–87, 1981.MathSciNetGoogle Scholar
  51. [51]
    B.T. Messmer and H. Bunke. A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognition, 32:1979–1998, 1008.CrossRefGoogle Scholar
  52. [52]
    A. Micheli. Neural network for graphs: A contextual constructive approach. IEEE Transactions on Neural Networks, 20(3):498–511, 2009.CrossRefGoogle Scholar
  53. [53]
    J. Munkres. Algorithms for the assignment and transportation problems. In Journal of the Society for Industrial and Applied Mathematics, volume 5, pages 32–38, March 1957.MATHCrossRefMathSciNetGoogle Scholar
  54. [54]
    R. Myers, R.C. Wilson, and E.R. Hancock. Bayesian graph edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(6):628–635, 2000.CrossRefGoogle Scholar
  55. [55]
    M. Neuhaus and H. Bunke. Self-organizing maps for learning the edit costs in graph matching. IEEE Transactions on Systems, Man, and Cybernetics (Part B), 35(3):503–514, 2005.CrossRefGoogle Scholar
  56. [56]
    M. Neuhaus and H. Bunke. Automatic learning of cost functions for graph edit distance. Information Sciences, 177(1):239–247, 2007.MATHCrossRefMathSciNetGoogle Scholar
  57. [57]
    M. Neuhaus and H. Bunke. Bridging the Gap Between Graph Edit Distance and Kernel Machines. World Scientific, 2007.Google Scholar
  58. [58]
    M. Neuhaus and H. Bunke. A quadratic programming approach to the graph edit distance problem. In F. Escolano and M. Vento, editors, Proc. 6th Int. Workshop on Graph Based Representations in Pattern Recognition, LNCS 4538, pages 92–102, 2007.Google Scholar
  59. [59]
    M. Neuhaus, K. Riesen, and H. Bunke. Fast suboptimal algorithms for the computation of graph edit distance. In Dit-Yan Yeung, J.T. Kwok, A. Fred, F. Roli, and D. de Ridder, editors, Proc. 11.th int. Workshop on Strucural and Syntactic Pattern Recognition, LNCS 4109, pages 163–172. Springer, 2006.Google Scholar
  60. [60]
    E. Pekalska and R. Duin. The Dissimilarity Representation for Pattern Recognition: Foundations and Applications. World Scientific, 2005.Google Scholar
  61. [61]
    M. Pelillo. Replicator equations, maximal cliques, and graph isomorphism. Neural Computation, 11(8): 1933–1955, 1999.CrossRefGoogle Scholar
  62. [62]
    K. Riesen and H. Bunke. Graph classification based on vector space embedding. Int. Journal of Pattern Recognition and Artificial Intelligence, 2008. accepted for publication.Google Scholar
  63. [63]
    K. Riesen and H. Bunke. Kernel k-means clustering applied to vector space embeddings of graphs. In L. Prevost, S. Marinai, and F. Schwenker, editors, Proc. 3rd IAPR Workshop Artificial Neural Networks in Pattern Recognition, LNAI 5064, pages 24–35. Springer, 2008.Google Scholar
  64. [64]
    K. Riesen and H. Bunke. Non-linear transformations of vector space embedded graphs. In A. Juan-Ciscar and G. Sanchez-Albaladejo, editors, Pattern Recognition in Information Systems, pages 173–186, 2008.Google Scholar
  65. [65]
    K. Riesen and H. Bunke. On Lipschitz embeddings of graphs. In I. Lovrek, R.J. Howlett, and L.C. Jain, editors, Proc. 12th International Conference, Knowledge-Based Intelligent Information and Engineering Systems, Part I, LNAI 5177, pages 131–140. Springer, 2008.Google Scholar
  66. [66]
    K. Riesen and H. Bunke. Reducing the dimensionality of dissimilarity space embedding graph kernels. Engineering Applications of Artificial Intelligence, 22(1):48–56, 2008.CrossRefGoogle Scholar
  67. [67]
    K. Riesen and H. Bunke. Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing, 27(4):950–959, 2009.CrossRefGoogle Scholar
  68. [68]
    K. Riesen and H. Bunke. Dissimilarity based vector space embedding of graphs using prototype reduction schemes. Accepted for publication in Machine Learning and Data Mining in Pattern Recognition, 2009.Google Scholar
  69. [69]
    A. Robles-Kelly and E.R. Hancock. String edit distance, random walks and graph matching. Int. Journal of Pattern Recognition and Artificial Intelligence, 18(3):315–327, 2004.CrossRefGoogle Scholar
  70. [70]
    A. Robles-Kelly and E.R. Hancock. A Riemannian approach to graph embedding. Pattern Recognition, 40:1024–1056, 2007.Google Scholar
  71. [71]
    A. Sanfeliu and K.S. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics (Part B), 13(3):353–363, 1983.MATHGoogle Scholar
  72. [72]
    F. Scarselli, M. Gori, A.C. Tsoi, M. Hagenbuchner, and G. Monfardini. The graph neural network model. IEEE Transactions on Neural Networks, 20(1):61–80, 2009.CrossRefGoogle Scholar
  73. [73]
    K. Schadler and F. Wysotzki. Comparing structures using a Hopfield-style neural network. Applied Intelligence, 11:15–30, 1999.CrossRefGoogle Scholar
  74. [74]
    A. Schenker, H. Bunke, M. Last, and A. Kandel. Graph-Theoretic Techniques for Web Content Mining. World Scientific, 2005.Google Scholar
  75. [75]
    B. Scholkopf and A. Smola. Learning with Kernels. MIT Press, 2002.Google Scholar
  76. [76]
    B. Scholkopf, A. Smola, and K.-R. Muller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10:1299–1319, 1998.CrossRefGoogle Scholar
  77. [77]
    J. Shawe-Taylor and N. Cristianini. Kernel Methods for Pattern Analysis. Cambridge University Press, 2004.Google Scholar
  78. [78]
    A. Shokoufandeh, D. Macrini, S. Dickinson, K. Siddiqi, and S.W. Zucker. Indexing hierarchical structures using graph spectra. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(7):1125–1140, 2005.CrossRefGoogle Scholar
  79. [79]
    A. Smola and R. Kondor. Kernels and regularization on graphs. In Proc. 16th. Int. Conf. on Comptuational Learning Theory, pages 144–158, 2003.Google Scholar
  80. [80]
    S. Sorlin and C. Solnon. Reactive tabu search for measuring graph similarity. In L. Brun and M. Vento, editors, Proc. 5th Int. Worksho on Graphbased Representations in Pattern Recognition, LNCS 3434, pages 172–182. Springer, 2005.Google Scholar
  81. [81]
    A. Sperduti and A. Starita. Supervised neural networks for the classification of structures. IEEE Transactions on Neural Networks, 8(3):714–735, 1997.CrossRefGoogle Scholar
  82. [82]
    B. Spillmann, M. Neuhaus, H. Bunke, E. Pekalska, and R. Duin. Transforming strings to vector spaces using prototype selection. In Dit-Yan Yeung, J.T. Kwok, A. Fred, F. Roli, and D. de Ridder, editors, Proc. 11. th int. Workshop on Strucural and Syntactic Pattern Recognition, LNCS 4109, pages 287–296. Springer, 2006.Google Scholar
  83. [83]
    P.N. Suganthan, E.K. Teoh, and D.P. Mital. Pattern recognition by graph matching using the potts MFT neural networks. Pattern Recognition, 28(7):997–1009, 1995.CrossRefGoogle Scholar
  84. [84]
    P.N. Suganthan, E.K. Teoh, and D.P. Mital. Pattern recognition by homomorphic graph matching using Hopfield neural networks. Image Vision Computing, 13(1):45–60, 1995.CrossRefGoogle Scholar
  85. [85]
    P.N. Suganthan, E.K. Teoh, and D.P. Mital. Self-organizing Hopfield network for attributed relational graph matching. Image Vision Computing, 13(1):61–73, 1995.CrossRefGoogle Scholar
  86. [86]
    Y. Tian and J.M. Patel. Tale: A tool for approximate large graph matching. In IEEE 24th International Conference on Data Engineering, pages 963–972, 2008.Google Scholar
  87. [87]
    A. Torsello and E. Hancock. Computing approximate tree edit distance using relaxation labeling. Pattern Recognition Letters, 24(8):1089–1097, 2003.MATHCrossRefGoogle Scholar
  88. [88]
    K. Tsuda. Support vector classification with asymmetric kernel function. In M. Verleysen, editor, Proc. 7th European Symposium on Artifical Neural Netweorks, pages 183–188, 1999.Google Scholar
  89. [89]
    J.R. Ullmann. An algorithm for subgraph isomorphism. Journal of the Association for Computing Machinery, 23(1):31–42, 1976.MathSciNetGoogle Scholar
  90. [90]
    S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 10(5):695–703, 1988.MATHCrossRefGoogle Scholar
  91. [91]
    M.A. van Wyk, T.S. Durrani, and B.J. van Wyk. A RKHS interpolator-based graph matching algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(7):988–995, 2003.CrossRefGoogle Scholar
  92. [92]
    J.-P. Vert and M. Kanehisa. Graph-driven features extraction from microarray data using diffusion kernels and kernel CCA. In Advances in Neural Information Processing Systems, volume 15, pages 1425–1432. MIT Press, 2003.Google Scholar
  93. [93]
    R.A. Wagner and M.J. Fischer. The string-to-string correction problem. Journal of the Association for Computing Machinery, 21(1):168–173, 1974.MATHMathSciNetGoogle Scholar
  94. [94]
    W.D. Wallis, P. Shoubridge, M. Kraetzl, and D. Ray. Graph distances using graph union. Pattern Recognition Letters, 22(6):701–704, 2001.MATHCrossRefGoogle Scholar
  95. [95]
    C. Watkins. Dynamic alignment kernels. In A. Smola, P.L. Bartlett, B. Scholkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 39–50. MIT Press, 2000.Google Scholar
  96. [96]
    R. Wilson and E.R. Hancock. Levenshtein distance for graph spectral features. In J. Kittler, M. Petrou, and M. Nixon, editors, Proc. 17th Int. Conf. on Pattern Recognition, volume 2, pages 489–492, 2004.CrossRefGoogle Scholar
  97. [97]
    R.C. Wilson and E. Hancock. Structural matching by discrete relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(6):634–648, 1997.CrossRefGoogle Scholar
  98. [98]
    R.C. Wilson, E.R. Hancock, and B. Luo. Pattern vectors from algebraic graph theory. IEEE Trans. on Pattern Analysis ans Machine Intelligence, 27(7):1112–1124, 2005.CrossRefGoogle Scholar
  99. [99]
    A.K.C. Wong and M. You. Entropy and distance of random graphs with application to structural pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7(5):599–609, 1985.MATHCrossRefGoogle Scholar
  100. [100]
    R. Xu and D. Wunsch. Survey of graph clustering algorithms. IEEE Transactions on Neural Networks, 16(3):645–678, 2005.CrossRefGoogle Scholar
  101. [101]
    Y. Yao, G.L. Marcialis, M. Pontil, P. Frasconi, and F. Roli. Combining flat and structured representations for fingerprint classification with recursive neural networks and support vector machines. Pattern Recognition, 36(2):397–406, 2003.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag US 2010

Authors and Affiliations

  1. 1.Institute of Computer Science and Applied Mathematics, University of BernBernSwitzerland
  2. 2.Department of Mathematics and Computer ScienceUniversity of Mu̶nsterMu̶nsterGermany

Personalised recommendations