The aim of this paper is to propose a new algorithm for Web services ranking. The proposed algorithm relies on a tree data structure that is constructed based on the scores of Web services. Two types of scores are considered, which are computed by respectively selecting the edge with the minimum or the edge with the maximum weight in the matching graph. The construction of the tree requires the successive use of both scores, leading to two different versions of the tree. The final ranking is obtained by applying a pre-order traversal on the tree and picks out all leaf nodes ordered from the left to the right. The performance evaluation shows that the proposed algorithm is most often better than similar ones.
|Title of host publication||The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015), Lisbon, Portugal, May 20-22|
|Editors||Valérie Monfort , Karl-Heinz Krempels|
|Publication status||Published - 2015|
|Event||The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015) - Lisbon, Portugal|
Duration: 20 May 2015 → 22 May 2015
|Conference||The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015)|
|Period||20/05/15 → 22/05/15|