Distance-based classification in OWL ontologies

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 Neighbor algorithm for OWL ontologies based on an epistemic 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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

D’Amato, C., Fanizzi, N., & Esposito, F. (2008). Distance-based classification in OWL ontologies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5178 LNAI, pp. 656–661). Springer Verlag. https://doi.org/10.1007/978-3-540-85565-1_81

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free