RWTH Aachen University
In this paper, the authors present the application of two RDF (Resource Description Framework) graph kernels to task 1 and 2 of the linked data data-mining challenge. Both graph kernels use term vectors to handle RDF literals. Based on experiments with the task data, they use the Weisfeiler-Lehman RDF graph kernel for task 1 and the intersection path tree kernel for task 2 in their final classifiers for the challenge. Applying these graph kernels is very straightforward and requires (almost) no preprocessing of the data.