Efficient semantic web service matching using common ontology  

基于公共本体的高效语义服务发现(英文)

作　　者：曹玖新[1,2] 秦屹[1,2] 张松[3] 刘波[1,2] 东方[1,2] 

机构地区：[1]东南大学计算机科学与工程学院,南京211189 [2]东南大学网络和信息集成教育部重点实验室,南京211189 [3]南京师范大学,南京210042

出　　处：《Journal of Southeast University(English Edition)》2012年第3期292-298,共7页东南大学学报（英文版）

基　　金：The National Basic Research Program of China(973 Program)(No.2010CB328104,2009CB320501);the National Natural Science Foundation of China(No.61070161,61070158,61003257, 61003311);the National Key Technology R&D Program during the 11th Five-Year Plan Period(No.2010BAI88B03);the Foundation of Jiangsu Provincial Key Laboratory of Netw ork and Information Security (No.BM2003201);Open Research Fund from Key Laboratory of Computer Netw ork and Information Integration of Ministry of Education (Southeast University)

摘　　要：To solve the bottleneck problem in centralized service discovery methods,a novel architecture based on domain ontology for semantic service discovery is proposed.This distributed architecture can adjust the domain partition and allocate system resources automatically.The characteristics of this mechanism are analyzed,including scalability,self-organization and adaptability.In this mechanism,semantic web service discovery is separated into two parts.First,under balance tree topology,registry proxy can rapidly forward requests to the objective registry center,and avoid the bottleneck problem.Secondly,a semantic distance based service matching algorithm is proposed to promote the effect of service searching.The results of simulation experiments show that the proposed mechanism can serve as a scalable solution for semantic web service publication and discovery.And the improved matching algorithm has higher recall and precision than other algorithms.为解决集中式服务发现结构存在的性能瓶颈问题,基于领域本体语义信息,提出一种能自适应地调整领域划分、分配系统资源的分布式web服务发现体系结构,并分析了该结构的可扩展性、自组织性和自适应性.具体描述了该结构下的语义web服务发现算法的2个阶段:语义注册中心定位和基于输入输出的服务匹配.在注册中心组成的平衡树拓扑结构中,注册代理能够快速将请求转发至目标注册中心,避免产生性能瓶颈.然后,通过引入一种新的基于语义距离的服务匹配算法来进行服务查询效果优化.模拟实验结果表明:提出的服务发现方法具有高可扩展性的优点;与其他服务查询算法相比,服务匹配算法具有更高的查全率和查准率.

关 键 词：service discovery domain ontology semantic web service semantic distance 

分 类 号：TP393.0[自动化与计算机技术—计算机应用技术]