Query Answering and Ontology Population: An Inductive Approach

In order to overcome the limitations of deductive logic-based approaches to deriving operational knowledge from ontologies, especially when data come from distributed sources, inductive (instance-based) methods may be better suited, since they are usually efficient and noise-tolerant. In this paper we propose an inductive method for improving the instance retrieval and enriching the ontology population. By casting retrieval as a classification problem with the goal of assessing the individual class-memberships w.r.t. the query concepts, we propose an extension of the k-Nearest Neighbor algorithm for OWL ontologies based on an entropic distance measure. The procedure can classify the individuals w.r.t. the known concepts but it can also be used to retrieve individuals belonging to query concepts. Experimentally we show that the behavior of the classifier is comparable with the one of a standard reasoner. Moreover we show that new knowledge (not logically derivable) is induced. It can be suggested to the knowledge engineer for validation, during the ontology population task.

[1]  I. Horrocks,et al.  The Instance Store: DL Reasoning with Large Numbers of Individuals , 2004, Description Logics.

[2]  Roberto Basili,et al.  AI*IA 2007: Artificial Intelligence and Human-Oriented Computing, 10th Congress of the Italian Association for Artificial Intelligence, Rome, Italy, September 10-13, 2007, Proceedings , 2007, AI*IA.

[3]  Nicola Fanizzi,et al.  Reasoning by Analogy in Description Logics Through Instance-based Learning , 2006, SWAP.

[4]  Enrico Motta,et al.  The Semantic Web - ISWC 2005, 4th International Semantic Web Conference, ISWC 2005, Galway, Ireland, November 6-10, 2005, Proceedings , 2005, SEMWEB.

[5]  Pavel Zezula,et al.  Similarity Search: The Metric Space Approach (Advances in Database Systems) , 2005 .

[6]  Quan Z. Sheng,et al.  Web Information Systems Engineering - Wise 2005 Workshops , 2008 .

[7]  Michèle Sebag,et al.  Distance Induction in First Order Logic , 1997, ILP.

[8]  Nicola Fanizzi,et al.  Evolutionary Conceptual Clustering of Semantically Annotated Resources , 2007, International Conference on Semantic Computing (ICSC 2007).

[9]  Volker Haarslev,et al.  On the Scalability of Description Logic Instance Retrieval , 2006, Journal of Automated Reasoning.

[10]  Pascal Hitzler,et al.  Resolution-Based Approximate Reasoning for OWL DL , 2005, SEMWEB.

[11]  Jan Paredaens,et al.  Advances in Database Systems , 1994 .

[12]  Frank van Harmelen,et al.  A Framework for Handling Inconsistency in Changing Ontologies , 2005, SEMWEB.

[13]  Nicola Fanizzi,et al.  Induction of Optimal Semi-distances for Individuals based on Feature Sets , 2007, Description Logics.

[14]  Heiner Stuckenschmidt,et al.  Scalable Instance Retrieval for the Semantic Web by Approximation , 2005, WISE Workshops.

[15]  Pavel Zezula,et al.  Similarity Search - The Metric Space Approach , 2005, Advances in Database Systems.

[16]  Bernhard Ganter,et al.  Completing Description Logic Knowledge Bases Using Formal Concept Analysis , 2007, IJCAI.

[17]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

[18]  Nicola Fanizzi,et al.  A Hierarchical Clustering Procedure for Semantically Annotated Resources , 2007, AI*IA.

[19]  Franz Baader.  Description Logics , 2009, Reasoning Web.

[20]  Alexander Borgida,et al.  Towards Measuring Similarity in Description Logics , 2005, Description Logics.