|Table of Contents|

[1] Kang Dazhou, Xu Baowen, Lu Jianjiang, et al. Approximate querying between heterogeneous ontologiesbased on association matrix [J]. Journal of Southeast University (English Edition), 2005, 21 (1): 1-5. [doi:10.3969/j.issn.1003-7985.2005.01.001]
Copy

Approximate querying between heterogeneous ontologiesbased on association matrix()
基于关系矩阵的异构本体间近似查询
Share：

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:
21
Issue:
2005 1
Page:
1-5
Research Field:
Computer Science and Engineering
Publishing date:
2005-03-30

Info

Title:
Approximate querying between heterogeneous ontologiesbased on association matrix
基于关系矩阵的异构本体间近似查询
Author(s):
Kang Dazhou1;  Xu Baowen1;  2;  Lu Jianjiang1;  2;  3;  Wang Peng1
1Department of Computer Science and Engineering, Southeast University, Nanjing 210096, China
2Jiangsu Institute of Software Quality, Nanjing 210096, China
3Institute of Science, PLA University of Science and Technology, Nanjing 210007, China
康达周1;  徐宝文1;  2;  陆建江1;  2;  3;  汪鹏1
1东南大学计算机科学与工程系, 南京 210096; 2江苏省软件质量研究所, 南京 210096; 3解放军理工大学理学院, 南京 210007
Keywords:
semantic web;  information retrieval;  ontology;  query;  association matrix
语义web;  信息检索;  本体;  查询;  关系矩阵
PACS:
TP311
DOI:
10.3969/j.issn.1003-7985.2005.01.001
Abstract:
An approximate approach of querying between heterogeneous ontology-based information systems based on an association matrix is proposed.First, the association matrix is defined to describe relations between concepts in two ontologies.Then, a method of rewriting queries based on the association matrix is presented to solve the ontology heterogeneity problem.It rewrites the queries in one ontology to approximate queries in another ontology based on the subsumption relations between concepts.The method also uses vectors to represent queries, and then computes the vectors with the association matrix;the disjoint relations between concepts can be considered by the results.It can get better approximations than the methods currently in use, which do not consider disjoint relations.The method can be processed by machines automatically.It is simple to implement and expected to run quite fast.
提出一种基于关系矩阵的异构本体信息系统间近似查询方法.首先定义关系矩阵表达不同本体的概念间关系, 然后给出一个重写查询方法.利用2个本体的概念间包含关系, 将一个本体中的查询重写为另一个本体中的近似查询, 从而解决本体异构问题.并提出用向量表示查询, 通过查询向量和关系矩阵计算的结果考虑不同本体概念间的不相交关系, 得到比现有方法更精确的近似查询结果.该方法可由机器自动完成, 易于实现且速度快.

References:

[1] Belkin N, Croft B.Information filtering and information retrieval:two sides of the same coin [J].Communications of the ACM, 1992, 35(12):29-38.
[2] Shah U, Finin T, Joshi A, et al.Information retrieval on the semantic web [A].In:Proceedings of the 10th International Conference on Information and Knowledge Management[C].New York:ACM Press, 2003.461-468.
[3] Guarino N.Formal ontology and information systems [A].In:Proceedings of the 1st International Conference on Formal Ontologies in Information Systems [C].Trento, Italy:IOS Press, 1998.3-15.
[4] Chang K C-C, Garcia-Molina H.Mind your vocabulary:query mapping across heterogeneous information sources [A].In:Proceedings of the ACM SIGMOD Conference [C].New York:ACM Press, 1999.335-346.
[5] Chang K C-C, Garcia-Molina H.Approximate query mapping:accounting for translation closeness [J].The VLDB Journal, 2001, 10(2, 3):155-181.
[6] Stuckenschmidt H.Approximate information filtering with multiple classification hierarchies [J].International Journal of Computational Intelligence and Applications, 2002, 2(3):295-302.
[7] Akahani J, Hiramatsu K, Satoh T.Approximate query reformulation based on hierarchical ontology mapping [A].In:International Workshop on Semantic Web Foundations and Application Technologies [C].Nara, Japan, 2003.43-46.
[8] Goasdoue F, Rousset M-C.Answering queries using views:a KRDB perspective for the semantic web [J].ACM Transactions on Internet Technology, 2004, 4(3):255-288.
[9] Doan A, Madhavan J, Domingos P, et al.Learning to map between ontologies on the semantic web [A].In:Proceedings of the 11th International Conference on World Wide Web [C].Hawaii, USA, 2002.662-673.
[10] Stuckenschmidt H.Ontology-based information sharing in weakly structured environments [D].Amsterdam, Netherlands:AI Department of Vrije Universiteit Amsterdam, 2002.

Memo

Memo:
Biographies: Kang Dazhou(1980—), male, graduate;Xu Baowen(corresponding author), male, doctor, professor, bwxu@seu.edu.cn.
Last Update: 2005-03-20