作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (15): 51-53. doi: 10.3969/j.issn.1000-3428.2008.15.018

• 软件技术与数据库 • 上一篇    下一篇

基于本体概念相似度的语义Web服务匹配算法

彭 晖1,2,3,史忠植1,邱莉榕1,3,常 亮1,3   

  1. (1. 中国科学院计算技术研究所智能信息处理重点实验室,北京 100080;2. 湖南科技大学计算机科学与工程学院,湘潭 411201; 3. 中国科学院研究生院,北京 100039)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-08-05 发布日期:2008-08-05

Matching Algorithm of Semantic Web Service Based on Similarity of Ontology Concepts

PENG Hui1,2,3, SHI Zhong-zhi1, QIU Li-rong1,3, CHANG Liang1,3   

  1. (1. Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080; 2. School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan 411201; 3. Graduate University of Chinese Academy of Sciences, Beijing 100039)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-08-05 Published:2008-08-05

摘要: 通过定义本体中概念之间的语义距离来计算本体概念之间的相似度,提出一种基于该相似度的Web服务的精确匹配算法,新的算法与经典的OWL-S/UDDI匹配算法比较,不仅在等级上保持一致,而且使同一等级或不同等级之间的服务匹配都达到精确的程度。用GEIS系统中Web服务的数据进行两种算法的性能测试,得出相似度匹配算法的平均查准率是OWL-S/UDDI匹配算法的1.8倍,平均查准率是OWL-S/UDDI匹配算法的1.4倍。

关键词: 语义Web服务, 服务匹配, 语义距离, 本体概念相似度

Abstract: A semantic distance between ontology concepts is defined to calculate the similarity between ontology concepts. Based on the similarity, a new semantic Web service matching algorithm is proposed. This algorithm abides by the grade of the classic OWL-S/UDDI algorithm and gives the precise matching between Web services. Experimental results show that the average precision of the new algorithm is 1.8 times than the OWL-S/UDDI algorithm and the average recall of the new algorithm is 1.4 times than the OWL-S/UDDI algorithm.

Key words: semantic Web service, service matching, semantic distance, similarity of ontology concepts

中图分类号: