电子科技大学学报2011，Vol.40Issue(4)：607-611,5.DOI:10.3969/j.issn.1001-0548.2011.04.027
基于服务关联模型的服务排序算法——ServiceRank
Service Ranking Algorithm Based on Service's RelationalModel—ServiceRank
摘要
Abstract
On the basis of Web service relational structure, this paper proposes an algorithm called ServiceRank to compute the service weight and rank the services In ServiceRank, by analyzing the relationship among the subsequent composable Web services, each Web service averagely distributes its weight by connectivity to all the subsequent composable Web services, and captures weight from all the predecessor composable Web services through the similar method. Compared with the current methods, ServiceRank has the ability to compute the unified weight function and to work offline. This paper thoroughly analyzes the convergence and stability of SercviceRank through experiments, which proves that the proposed algorithm has a high stability and efficiency.关键词
服务组合/服务排序/服务关联结构/面向服务的计算/Web服务Key words
service composition/ service ranking/ service relational structure/ SOC/ Web service分类
信息技术与安全科学引用本文复制引用
朱怡安,雷万保..基于服务关联模型的服务排序算法——ServiceRank[J].电子科技大学学报,2011,40(4):607-611,5.基金项目
部级基础科研项目 （）
部级预研基金 （）
