Abstract
The number of services on the web is growing every day and finding useful and efficient ranking methods for services has become an important issue in modern web applications. In this paper we present a link-based importance model and efficient algorithms for distributed services collaborating through service calls. We adapt the PageRank algorithm and define a service importance that reflects its activity and its contribution to the quality of other services. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Constantin, C., Amann, B., & Gross-Amblard, D. (2006). A link-based ranking model for services. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4275 LNCS-I, pp. 327–344). Springer Verlag. https://doi.org/10.1007/11914853_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
