Abstract
A new challenge in Web services reputation systems is to update the reputation of component services. As an emerging solution, rating propagation has received much attention recently. Current rating propagation algorithms either fail to fairly distribute the overall rating to component services or can realize a fair rating distribution at the cost of exponential time complexity. In this paper, we propose a fast Shapley value approach to propagate the overall rating of a composite service to its component services. Our approach ensures the fairness of rating propagation by using the advantage of the Shapley value, but significantly decreases its computational complexity from exponential to quadratic. Its fairness and efficiency are validated by experiments.
Original language | English |
---|---|
Pages (from-to) | 466-480 |
Number of pages | 15 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Volume | 8421 LNCS |
Issue number | PART 1 |
DOIs | |
Publication status | Published - 1 Jan 2014 |
Externally published | Yes |
Event | 19th International Conference on Database Systems for Advanced Applications, DASFAA 2014 - Bali, Indonesia Duration: 21 Apr 2014 → 24 Apr 2014 |
Keywords
- reputation propagation
- service composition
- Shapley value
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science