摘要
提出了一种基于可组合关联模型的服务排序算法.该算法充分挖掘服务间的关联关系,将每个Web服务重要度关联到所有直接前驱可组合的Web服务上,而每个Web服务又将自身权重值以类似的方式分配给所有后续可组合的Web服务.另外,该算法独立于具体的服务组合过程且可离线工作,执行效率高且排序结果比较稳定.最后,以实验证明了该算法能够有效地实现对Web服务的排序.
A new Web service ordering algorithm based composable relevance model was proposed. In this algorithm, the relevance model among Web services was identified, and the weight of each Web services is composed from its in-links Web services, and its weight is distributed to other out-links Web services by similar way. In addition, the algorithm is independence of the process and offers offline working model, so it can run with high efficiency and offer more stable ordering set. Finally, ac cording to some extensive experiments, we prove that the algorithm can effective realize the ordering of Web services.
出处
《华中科技大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2010年第1期105-108,共4页
Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金
国家自然科学基金资助项目(60573101)
关键词
WEB服务
面向服务的架构
服务组合
服务排序
关联模型
Web services (WS)
service oriented architecture
service composition
service ordering
relevance model