A Fast Approximation of the Weisfeiler-Lehman Graph Kernel for RDF Data

  • Gerben K. D. de Vries
Conference paper

DOI: 10.1007/978-3-642-40988-2_39

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8188)
Cite this paper as:
de Vries G.K.D. (2013) A Fast Approximation of the Weisfeiler-Lehman Graph Kernel for RDF Data. In: Blockeel H., Kersting K., Nijssen S., Železný F. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2013. Lecture Notes in Computer Science, vol 8188. Springer, Berlin, Heidelberg

Abstract

In this paper we introduce an approximation of the Weisfeiler-Lehman graph kernel algorithm aimed at improving the computation time of the kernel when applied to Resource Description Framework (RDF) data. Typically, applying graph kernels to RDF is done by extracting subgraphs from a large RDF graph and computing the kernel on this set of subgraphs. In contrast, our algorithm computes the Weisfeiler-Lehman kernel directly on the large RDF graph, but still retains the subgraph information. We show that this algorithm is faster than the regular Weisfeiler-Lehman kernel for RDF data and has at least the same performance. Furthermore, we show that our method has similar or better performance, and is faster, than other recently introduced graph kernels for RDF.

Keywords

Resource Description Framework (RDF) Graph Kernels Weisfeiler-Lehman 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Gerben K. D. de Vries
    • 1
  1. 1.System and Network Engineering Group, Informatics InstituteUniversity of AmsterdamThe Netherlands

Personalised recommendations