Task-oriented web service discovery algorithm using semantic similarity for adaptive service composition  

自适应服务组合中基于语义相似度及面向任务的服务发现算法(英文)

作　　者：文俊浩[1,2] 江卓[1] 涂丽云[2] 何盼[1] 

机构地区：[1]重庆大学计算机学院,重庆400030 [2]重庆大学软件工程学院,重庆400030

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

基　　金：The National Key Technology R&D Program of Chinaduring the 11th Five-Year Plan Period(No2007BAF23B0302);the Major Research Plan of the National Natural Science Foundation of China(No90818028)

摘　　要：In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects. Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition （TWC） graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement realtime updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.为了实现自适应和高效的Web服务组合,提出了一种面向任务的服务发现算法.将传统的服务组合过程划分为语义上的发现和功能上的匹配,并将任务作为操作对象,利用语义相似度从候选服务中寻找与给定任务相匹配的服务,并生成对应的TWC图,同时针对新服务设计更新算法.将该方法应用到服务组合模型中,搜索TWC图以得到一条最优的路径作为服务组合结果输出,并能在服务失效时做出实时的更新以完成服务请求.实验结果证明了算法的可行性和有效性,也表明当最大搜索半径取2时,服务数量和质量之间可达到平衡.

关 键 词：web service service composition service discovery ONTOLOGY semantic similarity 

分 类 号：TP331[自动化与计算机技术—计算机系统结构]