- A Fast and Simple Graph Kernel for RDF
- CEUR Workshop Proceedings
- Document type
- Faculty of Science (FNWI)
- Informatics Institute (IVI)
In this paper we study a graph kernel for RDF based on constructing a tree for each instance and counting the number of paths in that tree. In our experiments this kernel shows comparable classification performance to the previously introduced intersection subtree kernel, but is significantly faster in terms of computation time. Prediction performance is worse than the state-of-the-art Weisfeiler Lehman RDF kernel, but our kernel is a factor 10 faster to compute. Thus, we
consider this kernel a very suitable baseline for learning from RDF data. Furthermore, we extend this kernel to handle RDF literals as bag-ofwords feature vectors, which increases performance in two of the four experiments.
- Proceedings title: Proceedings of the International Workshop on Data Mining on Linked Data, with Linked Data Mining Challenge,
collocated with the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases
(ECMLPKDD 2013): Prague, Czech Republic, September 23, 2013
Place of publication: Aachen
Editors: C. d' Amato, P. Berka, V. Svátek, K. Wecel
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.