Published: 2012 Mai
Herausgeber: Elena Simperl et. al.
Buchtitel: Proc. of the 9th Extended Semantic Web Conference (ESWC'12)
Referierte VeröffentlichungNote: Best Research Paper Award of ESWC 2012
The increasing availability of structured data in Resource Description Framework (RDF) format poses new challenges and opportunities for data mining. Existing approaches to mining RDF have only focused on one specific data representation, one specific machine learning algorithm or one specific task. Kernels, however, promise a more flexible approach by providing a powerful framework for decoupling the data representation from the learning task. This paper focuses on how the well established family of kernel-based machine learning algorithms can be readily applied to instances represented as RDF graphs. We first review the problems that arise when conventional graph kernels are used for RDF graphs. We then introduce two versatile families of graph kernels specifically suited for RDF, based on intersection graphs and intersection trees. The flexibility of the approach is demonstrated on two common relational learning tasks: entity classification and link prediction. The results show that our novel RDF graph kernels used with Support Vector Machines (SVMs) achieve competitive predictive performance when compared to specialized techniques for both tasks.