Integrating New Refinement Operators in Terminological Decision Trees Learning

  • Giuseppe Rizzo
  • Nicola Fanizzi
  • Jens Lehmann
  • Lorenz Bühmann
Conference paper

DOI: 10.1007/978-3-319-49004-5_33

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10024)
Cite this paper as:
Rizzo G., Fanizzi N., Lehmann J., Bühmann L. (2016) Integrating New Refinement Operators in Terminological Decision Trees Learning. In: Blomqvist E., Ciancarini P., Poggi F., Vitali F. (eds) Knowledge Engineering and Knowledge Management. EKAW 2016. Lecture Notes in Computer Science, vol 10024. Springer, Cham

Abstract

The problem of predicting the membership w.r.t. a target concept for individuals of Semantic Web knowledge bases can be cast as a concept learning problem, whose goal is to induce intensional definitions describing the available examples. However, the models obtained through the methods borrowed from Inductive Logic Programming e.g. Terminological Decision Trees, may be affected by two crucial aspects: the refinement operators for specializing the concept description to be learned and the heuristics employed for selecting the most promising solution (i.e. the concept description that describes better the examples). In this paper, we started to investigate the effectiveness of Terminological Decision Tree and its evidential version when a refinement operator available in DL-Learner and modified heuristics are employed. The evaluation showed an improvement in terms of the predictiveness.

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Giuseppe Rizzo
    • 1
  • Nicola Fanizzi
    • 1
  • Jens Lehmann
    • 2
  • Lorenz Bühmann
    • 3
  1. 1.LACAM - Università degli Studi di BariBariItaly
  2. 2.Computer Science InstituteUniversity of BonnBonnGermany
  3. 3.AKSW- Univerität LeipzigLeipzigGermany

Personalised recommendations