摘要
针对服务组合规划问题,提出了一种基于服务连接关系的启发式算法。该算法首先根据领域本体中概念条件出现概率提出了一种新的服务接口分量关联程度量化指标,再利用二分图稳定匹配算法解决了多输入输出分量接口匹配问题,在此基础上将服务组合规划抽象为与或图搜索,采用启发式算法实现了服务组合。实验结果表明,该算法能够根据用户请求动态的生成复合服务,通过服务连接分析预处理,可以有效解决输入输出接口多分量的服务连接问题,提高了服务组合效率。
Aiming at web service composition, a heuristic algorithm based on interface connective relation is proposed. In this algorithm, the measure of association degree is computed based on the concept encountering conditional probability in domain ontology, and then the connective correspondence relation is achieved by the stable matching algorithm, so that web services composition can be abstracted to the problem of AND/OR graph searching, and solved by the heuristic algorithm. Experiments show that this method can accomplish the services composition according to user requests and effectively deal with service connection problem between multi-interface members by pre-processing of service connective analysis.
出处
《计算机工程与设计》
CSCD
北大核心
2010年第1期179-183,共5页
Computer Engineering and Design
基金
总装"十一五"预研基金项目(10408)
关键词
WEB服务
服务连接度
稳定匹配
服务组合
与或图搜索
启发式算法
web service
service connectivity
stable matching
service composition
AND/OR graph search
heuristic algorithm
