Fast Graph Kernels for RDFPosted by in collaboration | computer science | large scale | semantic web | vu university amsterdam
The first paper: “A Fast Approximation of the Weisfeiler-Lehman Graph Kernel for RDF Data” was accepted into the main conference and the second paper: “A Fast and Simple Graph Kernel for RDF” was accepted at the DMoLD workshop.
We include links to the papers, to the software and to the datasets used in the experiments, which are stored in figshare. Furthermore, we explain how to rerun the experiments from the papers using a precompiled JAR file, to make the effort required as minimal as possible.
You can follow any responses to this entry through the RSS 2.0 Both comments and pings are currently closed.