Probabilistic Approach for Diversifying Web Services Discovery and Composition

Abstract : Due to the increasing number of available web services, discovering the best service that matches a user requirement is still a challenge. In most cases the discovery system returns a set of very similar services and sometimes it is unable to find results for some complex queries. Therefore, integrating web service discovery and composition, taking into account the diversity of discovered results, in a unified way is still a big issue for web services. In this paper, we propose a novel service ranking algorithm for diversifying web services discovery results in order to minimize the redundancy in the search results. This algorithm chooses a set of selected web services based on relevancy, service diversity and service density. We also propose a new method to generate service dependency network using the Formal Concept Analysis (FCA) framework. The generated graph is used to select the composition of discovered web services set. Experimental results show that our method performs better than others baseline approaches.
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download
Contributor : Nicolas Durand <>
Submitted on : Wednesday, December 12, 2018 - 2:16:41 PM
Last modification on : Thursday, February 7, 2019 - 2:42:27 PM
Long-term archiving on : Wednesday, March 13, 2019 - 3:17:38 PM


Files produced by the author(s)


  • HAL Id : hal-01465112, version 1



Hafida Naim, Mustapha Aznag, Mohamed Quafafou, Nicolas Durand. Probabilistic Approach for Diversifying Web Services Discovery and Composition. IEEE 23rd IEEE International Conference on Web Services (ICWS 2016), 2016, San Francisco, CA, United States. pp.73-80. ⟨hal-01465112⟩



Record views


Files downloads