Distance-Based Classification in OWL Ontologies
暂无分享,去创建一个
We propose inductive distance-based methods for instance classification and retrieval in ontologies. 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 Neighboralgorithm for OWL ontologies based on an epistemicdistance 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] Bernhard Ganter,et al. Completing Description Logic Knowledge Bases Using Formal Concept Analysis , 2007, IJCAI.
[2] Nicola Fanizzi,et al. Induction of Optimal Semi-distances for Individuals based on Feature Sets , 2007, Description Logics.
[3] Volker Haarslev,et al. On the Scalability of Description Logic Instance Retrieval , 2006, KI.
[4] Nicola Fanizzi,et al. Reasoning by Analogy in Description Logics Through Instance-based Learning , 2006, SWAP.