Concept Induction in Description Logics Using Information-Theoretic Heuristics

Concept Induction in Description Logics Using Information-Theoretic Heuristics

Nicola Fanizzi (University of Bari, Italy)
DOI: 10.4018/978-1-4666-3610-1.ch005
OnDemand PDF Download:
No Current Special Offers


This paper presents an approach to ontology construction pursued through the induction of concept descriptions expressed in Description Logics. The author surveys the theoretical foundations of the standard representations for formal ontologies in the Semantic Web. After stating the learning problem in this peculiar context, a FOIL-like algorithm is presented that can be applied to learn DL concept descriptions. The algorithm performs a search through a space of candidate concept definitions by means of refinement operators. This process is guided by heuristics that are based on the available examples. The author discusses related theoretical aspects of learning with the inherent incompleteness underlying the semantics of this representation. The experimental evaluation of the system DL-Foil, which implements the learning algorithm, was carried out in two series of sessions on real ontologies from standard repositories for different domains expressed in diverse description logics.
Chapter Preview

1 Introduction

Formal ontologies are likely to play a key role in the next generation information systems moving from legacy to (linked) open data whose semantics is intended to be formalized and shared across the Web (Staab & Studer, 2009). One of the bottlenecks of this process is certainly represented by the construction (and evolution) of the ontologies since it involves different actors: domain experts contribute their knowledge but this is to be formalized by knowledge engineers so that it can be mechanized for the machines.

As the gap between these roles likely makes the process slow and burdensome, this problem may be tackled by resorting to machine learning techniques. Ontology learning (Cimiano, Mädche, Staab, & Völker, 2009) is intended to provide solutions to the problem of (semi-) automated ontology construction. Cast as an information extraction subtask, ontology learning has focused on learning from text corpora (Buitelaar & Cimiano, 2008). The main drawback of this approach is that the elicited concepts and relations are represented with languages of limited expressiveness. A different approach can be based on relational learning (see De Raedt, 2008, for a recent survey), which requires a limited effort from domain experts (labeling individual resources as instances or non instances of the target concepts) and which leads to the construction of concepts even in very expressive languages (Lehmann, 2010).

If the concept learning problem is tackled as a search through a space of candidate descriptions in the reference representation guided by exemplars of the target concepts, then the same algorithms can be adapted to solve also ontology evolution problems. Indeed, while normally the semantics of change operations for this task has been considered from the logical and deductive point of view of automated reasoning, a relevant part of information lying in the data that populates ontological knowledge bases is generally overlooked or plays a secondary role.

Description Logics (DLs) is a family of languages supporting the standard ontology languages designed for knowledge bases in the context of the Semantic Web. These logics constitute specific fragments of First Order Logic (FOL) that differ from the standard clausal languages employed in relational learning, namely they have a different syntax and especially very different semantics (Borgida, 1996; Baader, Calvanese, McGuinness, Nardi, & Patel-Schneider, 2007). This motivates the growing interest in investigating inductive methods for such new formalisms.

Complete Chapter List

Search this Book: