Approximate querying between heterogeneous ontologies based on association matrix  

基于关系矩阵的异构本体间近似查询(英文)

作　　者：康达周[1] 徐宝文[1] 陆建江[1] 汪鹏[1] 

机构地区：[1]东南大学计算机科学与工程系,南京210096

出　　处：《Journal of Southeast University(English Edition)》2005年第1期1-5,共5页东南大学学报（英文版）

基　　金：TheNationalNaturalScienceFoundationofChina(No.60373066,60303024,60403016),theNationalBasicResearchProgramofChina(973Program)(No.2002CB312000),SpecializedResearchFundfortheDoctoralProgramofHigherEducation(No.20020286004).

摘　　要：An approximate approach of querying between heterogeneous ontology-basedinformation systems based on an association matrix is proposed. First, the association matrix isdefined to describe relations between concepts in two ontologies. Then, a methodof rewriting queriesbased on the association matrix is presented to solve the ontology heterogeneity problem. Itrewrites the queries in one ontology to approximate queries in another ontology based on thesubsumption relations between concepts. The method also uses vectors to represent queries, and thencomputes the vectors with the association matrix; the disjoint relations between concepts can beconsidered by the results. It can get better approximations than the methods currently in use, whichdonot consider disjoint relations. The method can be processed by machines automatically. It issimple to implement and expected to run quite fast.提出一种基于关系矩阵的异构本体信息系统间近似查询方法.首先定义关系矩阵表达不同本体的概念间关系,然后给出一个重写查询方法.利用2个本体的概念间包含关系,将一个本体中的查询重写为另一个本体中的近似查询,从而解决本体异构问题.并提出用向量表示查询,通过查询向量和关系矩阵计算的结果考虑不同本体概念间的不相交关系,得到比现有方法更精确的近似查询结果.该方法可由机器自动完成,易于实现且速度快.

关 键 词：semantic web information retrieval ONTOLOGY QUERY association matrix 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]