基于关系矩阵的异构本体间近似查询.pdfVIP

Journal of Southeast University ( English Edition) Vol. 21, No. 1, pp. 1 5 Mar. 2005 ISSN 1003—7985 Approximate guerying between heterogeneous ontologies based on association matrix 1 1, 2 1, 2, 3 1 Kang Dazhou Xu Baowen Lu Jianjiang Wang Peng 1 ( Department of Computer Science and Engineering, Southeast University, Nanjing 210096, China) 2 ( Jiangsu Institute of Software Guality, Nanjing 210096, China) 3 ( Institute of Science, PLA University of Science and Technology, Nanjing 210007, China) Abstract : An approximate approach of guerying 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 gueries based on the association matrix is presented to solve the ontology heterogeneity problem. It rewrites the gueries in one ontology to approximate gueries in another ontology based on the subsumption relations between concepts. The method also uses vectors to represent gueries, 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 guite fast. Key words: semantic web; information retrieval; on