A method for optimizing top-k composite services towards preference-aware service dominance
- Publication Type:
- Journal Article
- International Journal of Web Services Research, 2013, 10 (2), pp. 63 - 86
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Web service composition allows users to create value-added composite Web services on existent services, where top-k composite services are helpful for users to find a satisfying composite service efficiently. However, with an increasing number of Web services and users' various composition preferences, computing top-k composite services dynamically for different users is difficult. In view of this challenge, an optimization method for top-k composite services is proposed, based on a preference-aware service dominance relationship. Concretely speaking, firstly, user preferences are modeled with the preference-aware service dominance. Then, in local service selection, a multi-index based algorithm is proposed, named Multi-Index, for computing candidate services of each task dynamically. After that, in global optimization, combined with a service lattice, top-k composite services are selected under a dominant number-aware service ranking. A case study is also presented for illustrating the authors' solution. At last, an experiment was conducted to verify the proposed method. © 2013, IGI Global.
Please use this identifier to cite or link to this item: