Kernel methods for mining instance data in ontologies

  • Authors:
  • Stephan Bloehdorn;York Sure

  • Affiliations:
  • Institute AIFB, University of Karlsruhe, Karlsruhe, Germany;SAP AG, Research Center CEC Karlsruhe, Karlsruhe, Germany

  • Venue:
  • ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The amount of ontologies and meta data available on the Web is constantly growing. The successful application of machine learning techniques for learning of ontologies from textual data, i.e. mining for the Semantic Web, contributes to this trend. However, no principal approaches exist so far for mining from the Semantic Web. We investigate how machine learning algorithms can be made amenable for directly taking advantage of the rich knowledge expressed in ontologies and associated instance data. Kernel methods have been successfully employed in various learning tasks and provide a clean framework for interfacing between non-vectorial data and machine learning algorithms. In this spirit, we express the problem of mining instances in ontologies as the problem of defining valid corresponding kernels. We present a principled framework for designing such kernels by means of decomposing the kernel computation into specialized kernels for selected characteristics of an ontology which can be flexibly assembled and tuned. Initial experiments on real world Semantic Web data enjoy promising results and show the usefulness of our approach.