Mapping ontology relations: an approach based on best approximations

Authors:
Peng Wang;Baowen Xu;Jianjiang Lu;Dazhou Kang;Jin Zhou
Affiliations:
Department of Computer Science and Engineering, Southeast University, Nanjing, China;Department of Computer Science and Engineering, Southeast University, Nanjing, China;Department of Computer Science and Engineering, Southeast University, Nanjing, China;Department of Computer Science and Engineering, Southeast University, Nanjing, China;Department of Computer Science and Engineering, Southeast University, Nanjing, China
Venue:
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Year:
2006

Citing 5
Cited 0

A translation approach to portable ontology specifications

Knowledge Acquisition - Special issue: Current issues in knowledge modeling
Learning to match ontologies on the Semantic Web

The VLDB Journal — The International Journal on Very Large Data Bases
The PROMPT suite: interactive tools for ontology merging and mapping

International Journal of Human-Computer Studies
Ontology mapping: the state of the art

The Knowledge Engineering Review
Approximations of concept based on multielement bounds

DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Relation mappings are important for interoperations between heterogeneous ontologies. Several current methods employ string similarity matching or heuristic rules to find them, but often produce low quality results. We propose a novel approach based on best approximations. The core idea is to find least upper bounds and greatest lower bounds of a relation, and then use them to get upper and lower approximations of the relation. These approximations are the relation mappings between ontologies. To discovery the best mappings, we extend the definition of least upper(/greatest lower) bounds as multielement least upper(/greatest lower) bounds, that not only containing separate relations, but also disjunctions or conjunctions of relations and the related concepts. The simplified multielement bounds are also defined to avoid redundancy. An effective algorithm for finding the relation mappings is proposed.