Applying Logical Constraints to Ontology Matching
Applying Logical Constraints to Ontology Matching
复制标题
DOI：
10.1007/978-3-540-74565-5_10
复制
发表时间：
2007-09
期刊：
影响因子：
--
通讯作者：
Christian Meilicke;H. Stuckenschmidt
中科院分区：
文献类型：
--
作者：
Christian Meilicke;H. Stuckenschmidt
自动发现本体之间的语义关系是克服语义Web上语义异构性的一项重要任务。然而，本体匹配系统经常产生错误的映射。本文提出了一种优化现有匹配系统的查准率和查全率的方法。这种方法的原理是基于这样的想法，即可以通过比较要匹配的本体的概念之间的包含关系来推断逻辑约束。为了验证这一原则，我们实现了一个系统，该系统使用我们的方法作为优化映射的基础。我们生成了一组合成本体和相应的缺陷映射，并研究了我们的方法关于匹配问题的性质的行为。结果表明，我们的策略实际上提高了生成的映射的质量。
Automatically discovering semantic relations between ontologies is an important task with respect to overcoming semantic heterogeneity on the semantic web. Ontology matching systems, however, often produce erroneous mappings. In this paper we propose a method for optimizing precision and recall of existing matching systems. The principle of this method is based on the idea that it is possible to infer logical constraints by comparing subsumption relations between concepts of the ontologies to be matched. In order to verify this principle we implemented a system that uses our method as basis for optimizing mappings. We generated a set of synthetic ontologies and corresponding defective mappings and studied the behavior of our method with respect to the properties of the matching problem. The results show that our strategy actually improves the quality of the generated mappings.