Learning disjointness

70Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

An increasing number of applications benefits from light-weight ontologies, or to put it differently "a little semantics goes a long way". However, our experience indicates that more expressiveness can offer significant advantages. Introducing disjointness axioms, for instance, greatly facilitates consistency checking and the automatic evaluation of ontologies. In an extensive user study we discovered that proper modeling of disjointness is a difficult and very time-consuming task. We therefore developed an approach to automatically enrich learned or manually engineered ontologies with disjointness axioms. This approach relies on several methods for obtaining syntactic and semantic evidence from different sources which we believe to provide a solid base for learning disjointness. After thoroughly evaluating the implementation of our approach we think that in future ontology engineering environments the automatic discovery of disjointness axioms may help to increase the richness, quality and usefulness of any given ontology. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Völker, J., Vrandečić, D., Sure, Y., & Hotho, A. (2007). Learning disjointness. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4519 LNCS, pp. 175–189). Springer Verlag. https://doi.org/10.1007/978-3-540-72667-8_14

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