首页> 外文会议>The semantic web: research and applications. >Identifying Complex Semantic Matches
【24h】

Identifying Complex Semantic Matches

机译:识别复杂的语义匹配

获取原文
获取原文并翻译 | 示例

摘要

One-to-one correspondences are not always sufficient to accurately align ontologies, and instead complex correspondences with conditions and transformations may be required. Correspondence patterns provide models which can be used to guide the process of developing complex correspondences. However, it is necessary to first identify which pattern to apply to a given alignment problem. This PhD proposes the development of algorithms, methods and processes for refining elementary correspondences between concepts or relations into complex ones by identifying which correspondence pattern best represents a given correspondence. To date an evaluation of a system to refine correspondences between classes in the YAGO and DBpedia ontologies has been completed. This evaluation showed that for a subsumption correspondence, a training set of 30 instances of the class being mapped was sufficient to refine the match to a conditional one 89% of the time. Hence we have shown that this is a promising approach for correspondences with a conditional element, and correspondences with a translation element will be examined next.
机译:一对一的对应关系并不总是足以准确地对齐本体,而是可能需要与条件和转换进行复杂的对应关系。对应模式提供了可用于指导开发复杂对应的过程的模型。但是,有必要首先确定将哪种图案应用于给定的对齐问题。该博士提出了一种算法,方法和过程的开发,该算法,方法和过程用于通过确定哪种对应关系模式最能代表给定的对应关系,将概念或关系之间的基本对应关系精炼为复杂的关系。迄今为止,已经完成了对优化YAGO和DBpedia本体中的类之间的对应关系的系统的评估。该评估表明,对于一个包含的对应关系,一个被映射的类的30个实例的训练集足以将匹配条件细化为有条件的89%的时间。因此,我们已经表明这是一种与条件元素对应的有前途的方法,接下来将研究与翻译元素的对应。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号