A Graph-Based Algorithm for Alignment of OWL Ontologies

IEEE/WIC/ACM International Conference on Web Intelligence (WI'07) Pub Date : 2007-11-02 DOI:10.1109/WI.2007.10

B. Le, R. Dieng

引用次数: 20

Abstract

This paper presents ASC03 algorithm, aimed at finding mappings between entities of two ontologies represented in OWL DL/Lite. ASC03 algorithm searches the maximal common subgraph of two graphs representing two ontologies, and relies on an algorithm of search of the maximal clique of their association graph.

查看原文本刊更多论文

基于图的OWL本体对齐算法

本文提出了ASC03算法，旨在寻找OWL DL/Lite中表示的两个本体的实体之间的映射。ASC03算法搜索表示两个本体的两个图的最大公共子图，并依赖于搜索它们的关联图的最大团的算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)

自引率

0.00%

发文量