Abstract
Graph kernels are usually defined in terms of simpler kernels over local substructures of the original graphs. Different kernels consider different types of substructures. However, in some cases they have similar predictive performances, probably because the substructures can be interpreted as approximations of the subgraphs they induce. In this paper, we propose to associate to each feature a piece of information about the context in which the feature appears in the graph. A substructure appearing in two different graphs will match only if it appears with the same context in both graphs. We propose a kernel based on this idea that considers trees as substructures, and where the contexts are features too. The kernel is inspired from the framework in [7], even if it is not part of it. We give an efficient algorithm for computing the kernel and show promising results on real-world graph classification datasets.
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
References
Aggarwal, C.C.: Managing and Mining Graph Data. Advances in Database Systems, vol. 40. Springer, Boston (2010)
Borgwardt, K., Kriegel, H.-P.: Shortest-path kernels on graphs. In: Fifth IEEE International Conference on Data Mining (ICDM 2005), pp. 74–81. IEEE, Los Alamitos (2005)
Collins, M., Duffy, N.: Convolution kernels for natural language. In: Dietterich, T.G., Becker, S., Ghahramani, Z. (eds.) NIPS, pp. 625–632. MIT Press, Cambridge (2001)
Collins, M., Duffy, N.: Convolution kernels for natural language. Adv. Neural Inf. Process. Syst. 14, 625–632 (2001)
Costa, F., De Grave, K.: Fast neighborhood subgraph pairwise distance kernel. In: Joachims, J.F., Thorsten (eds.) Proceedings of the 27th International Conference on Machine Learning (ICML 2010), pp. 255–262. Omnipress (2010)
Da San Martino, G., Navarin, N., Sperduti, A.: A memory efficient graph kernel. In: The 2012 International Joint Conference on Neural Networks (IJCNN). IEEE, June 2012
Da San Martino, G., Navarin, N., Sperduti, A.: A tree-based kernel for graphs. In: Proceedings of the Twelfth SIAM International Conference on Data Mining, pp. 975–986 (2012)
Da San Martino, G., Navarin, N., Sperduti, A.: Exploiting the ODD framework to define a novel effective graph kernel. In: Proceedings of the European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (2015)
Da San Martino, G., Sperduti, A.: Mining structured data. IEEE Comput. Int. Mag. 5(1), 42–49 (2010)
Gärtner, T., Flach, P.A., Wrobel, S.: On graph kernels: hardness results and efficient alternatives. In: Schölkopf, B., Warmuth, M.K. (eds.) COLT/Kernel 2003. LNCS (LNAI), vol. 2777, pp. 129–143. Springer, Heidelberg (2003)
Haussler, D.: Convolution kernels on discrete structures. Technical report, Department of Computer Science, University of California at Santa Cruz (1999)
Shervashidze, N., Schweitzer, P., van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-Lehman graph kernels. J. Mach. Learn. Res. 12, 2539–2561 (2011)
Vishwanathan, S., Borgwardt, K.M., Schraudolph, N.N.: Fast computation of graph kernels. In: Schölkopf, B., Platt, J., Hoffman, T. (eds.) Advances in Neural Information Processing Systems, vol. 19, pp. 1449–1456. MIT Press, Cambridge (2007)
Vishwanathan, S.V.N., Schraudolph, N.N., Kondor, R., Borgwardt, K.M.: Graph kernels. J. Mach. Learn. Res. 11, 1201–1242 (2010)
Acknowledgments
This work was supported by the University of Padova under the strategic project BIOINFOGEN.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Navarin, N., Sperduti, A., Tesselli, R. (2015). Extending Local Features with Contextual Information in Graph Kernels. In: Arik, S., Huang, T., Lai, W., Liu, Q. (eds) Neural Information Processing. ICONIP 2015. Lecture Notes in Computer Science(), vol 9492. Springer, Cham. https://doi.org/10.1007/978-3-319-26561-2_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-26561-2_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26560-5
Online ISBN: 978-3-319-26561-2
eBook Packages: Computer ScienceComputer Science (R0)