Skip to content

A tree-based algorithm for ranking web services

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

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.
Original languageEnglish
Title of host publicationThe 11th International Conference on Web Information Systems and Technologies (WEBIST 2015), Lisbon, Portugal, May 20-22
EditorsValérie Monfort , Karl-Heinz Krempels
PublisherSciTePress
Pages170-178
ISBN (Print)9789897581069
DOIs
Publication statusPublished - 2015
EventThe 11th International Conference on Web Information Systems and Technologies (WEBIST 2015) - Lisbon, Portugal
Duration: 20 May 201522 May 2015

Conference

ConferenceThe 11th International Conference on Web Information Systems and Technologies (WEBIST 2015)
CountryPortugal
CityLisbon,
Period20/05/1522/05/15

Documents

Related information

Relations Get citation (various referencing formats)

ID: 2259535