Zurück zur Übersicht

Instance-Based Ontology Matching Using Different Kinds Of Formalisms

full text: PDF
author/s: Katrin Zaiß, Tim Schlüter, Stefan Conrad
journal:Proceedings of the International Conference on Semantic Web Engineering, World Academy of Science, Engineering and Technology, July 29-21, Oslo, Norway
annote:World Academy of Science, Engineering and Technology

Ontology Matching is a task needed in various applications, for example for comparison or merging purposes. In literature, many algorithms solving the matching problem can be found, but most of them do not consider instances at all. Mappings are determined by calculating the string-similarity of labels, by recognizing linguistic word relations (synonyms, subsumptions etc.) or by analyzing the (graph) structure. Due to the facts that instances are often modeled within the ontology and that the set of instances describes the meaning of the concepts better than their meta information, instances should definitely be incorporated into the matching process. In this paper several novel instance-based matching algorithms are presented which enhance the quality of matching results obtained with common concept-based methods. Different kinds of formalisms are use to classify concepts on account of their instances and finally to compare the concepts directly.

Heinrich Heine Universität

Datenbanken und Informationssysteme


Prof. Dr. Stefan Conrad

Universitätsstr. 1
40225 Düsseldorf
Gebäude: 25.12
Etage/Raum: 02.24
Tel.: +49 211 81-14088
Fax: +49 211 81-13463


Sabine Freese

Mo-Fr: 10:00-11:30 Uhr
Mo-Do: 13:00-14:30 Uhr

Universitätsstr. 1
40225 Düsseldorf
Gebäude: 25.12
Etage/Raum: 02.22
Tel.: +49 211 81-11312
Fax: +49 211 81-13463
Verantwortlich für den Inhalt:  E-Mail senden WE Informatik