您当前所在位置: 首页 > 学者

瞿裕忠

  • 10浏览

  • 0点赞

  • 0收藏

  • 0分享

  • 67下载

  • 0评论

  • 引用

期刊论文

GMO: A Graph Matching for Ontologies

瞿裕忠Wei Hu Ningsheng Jian Yuzhong Qu Yanbing Wang

,-0001,():

URL:

摘要/描述

Ontology matching is an important task to achieve interoperation between semantic web applications using different ontologies. Structural similarity plays a central role in ontology matching. However, the existing approaches rely heavily on lexical similarity, and they mix up lexical similarity with structural similarity. In this paper, we present a graph matching approach for ontologies, called GMO. It uses bipartite graphs to represent ontologies, and measures the structural similarity between graphs by a new measurement. Furthermore, GMO can take a set of matched pairs, which are typically previously found by other approaches, as external input in matching process. Our implementation and experimental results are given to demonstrate the eec tiveness of the graph matching approach.

版权说明:以下全部内容由瞿裕忠上传于   2009年01月22日 17时09分02秒,版权归本人所有。

我要评论

全部评论 0

本学者其他成果

    同领域成果