Implicit and Explicit Graph Embedding: Comparison of Both Approaches on Chemoinformatics Applications

  • Benoit Gaüzère
  • Makoto Hasegawa
  • Luc Brun
  • Salvatore Tabbone
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7626)

Abstract

Defining similarities or distances between graphs is one of the bases of the structural pattern recognition field. An important trend within this field consists in going beyond the simple formulation of similarity measures by studying properties of graph’s spaces induced by such distance or similarity measures . Such a problematic is closely related to the graph embedding problem. In this article, we investigate two types of similarity measures. The first one is based on the notion of graph edit distance which aims to catch a global dissimilarity between graphs. The second family is based on comparisons of bags of patterns extracted from graphs to be compared. Both approaches are detailed and their performances are evaluated on different chemoinformatics problems.

Keywords

Tree Pattern Edit Distance Input Graph Graph Match Krein Space 
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

  1. 1.
    Villemin, D., Gaüzére, B., Brun, L., Mokhtari-Brun, M.: Graph kernels based on relevant patterns and cycle information for chemoinformatics. In: Proceedings of ICPR 2012 (to be published, 2012)Google Scholar
  2. 2.
    Bunke, H.: Error correcting graph matching: On the influence of the underlying cost function. IEEE Transactions on Pattern Analysis and Machine Intelligence 21(9), 917–922 (1999)CrossRefGoogle Scholar
  3. 3.
    Dattorro, J.: Convex Optimization and Euclidean Distance Geometry. Meboo Publishing, USA (2005)Google Scholar
  4. 4.
    de Mauro, C., Diligenti, M., Gori, M., Maggini, M.: Similarity learning for graph-based image representations. Pattern Recognition Letters 24(8), 1115–1122 (2003)MATHCrossRefGoogle Scholar
  5. 5.
    Gärtner, T., Flach, P.A., Wrobel, S.: On graph kernels: Hardness results and efficient alternatives. In: Proceedings of the 16th Annual Conference on Computational Learning Theory and the 7th Kernel Workshop (2003)Google Scholar
  6. 6.
    Gaüzére, B., Brun, L., Villemin, D.: Two new graphs kernels in chemoinformatics. Pattern Recognition Letters (in Press, 2012)Google Scholar
  7. 7.
    Jouili, S., Tabbone, S.: Graph Matching Based on Node Signatures. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, vol. 5534, pp. 154–163. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  8. 8.
    Jouili, S., Tabbone, S.: Graph Embedding Using Constant Shift Embedding. In: Ünay, D., Çataltepe, Z., Aksoy, S. (eds.) ICPR 2010. LNCS, vol. 6388, pp. 83–92. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  9. 9.
    Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized Kernels Between Labeled Graphs. Machine Learning (2003)Google Scholar
  10. 10.
    Mahé, P., Vert, J.-P.: Graph kernels based on tree patterns for molecules. Machine Learning 75(1), 3–35 (2009)CrossRefGoogle Scholar
  11. 11.
    Ramon, J., Gärtner, T.: Expressivity versus efficiency of graph kernels. In: First International Workshop on Mining Graphs, Trees and Sequences, Citeseer, pp. 65–74 (2003)Google Scholar
  12. 12.
    Ren, P., Wilson, R., Hancock, E.: Graph Characteristics from the Ihara Zeta Function. 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. 257–266. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  13. 13.
    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)CrossRefGoogle Scholar
  14. 14.
    Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vision Comput. 27(7), 950–959 (2009)CrossRefGoogle Scholar
  15. 15.
    Roth, V., Laub, J., Kawanabe, M., Buhmann, J.M.: Optimal cluster preserving embedding of nonmetric proximity data. IEEE Trans. Pattern Anal. Mach. Intell. 25(12), 1540–1551 (2003)CrossRefGoogle Scholar
  16. 16.
    Vishwanathan, S.V.N., Schraudolph, N., Kondor, I.R., Borgwardt, K.: Graph kernels. Journal of Machine Learning Research 11 (April 2010)Google Scholar
  17. 17.
    Toivonen, H., Srinivasan, A., King, R., Kramer, S., Helma, C.: Statistical evaluation of the predictive toxicology challenge 2000-2001. Bioinformatics 19(10), 1183–1193 (2003)CrossRefGoogle Scholar
  18. 18.
    Torsello, A., Hancock, E.R.: Graph embedding using tree edit-union. Pattern Recognition 40(5), 1393–1405 (2007)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Benoit Gaüzère
    • 1
  • Makoto Hasegawa
    • 2
  • Luc Brun
    • 1
  • Salvatore Tabbone
    • 2
  1. 1.Université de Caen - Basse Normandie-GREYC CNRS UMR 6072CaenFrance
  2. 2.Université de Lorraine-LORIA CNRS UMR 7503NancyFrance

Personalised recommendations