A tree-based algorithm for ranking web services

Fatma-Ezzahra   Gmati; Nadia   Yacoubi-Ayadi; Afef Bahri; Salem Chakhar; Alessio Ishizaka

doi:10.5220/0005498901700178

A tree-based algorithm for ranking web services

Fatma-Ezzahra Gmati, Nadia Yacoubi-Ayadi, Afef Bahri, Salem Chakhar, Alessio Ishizaka

Centre for Operational Research & Logistics

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

144 Downloads (Pure)

Abstract

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 language	English
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
Publisher	SciTePress
Pages	170-178
ISBN (Print)	9789897581069
DOIs	https://doi.org/10.5220/0005498901700178
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

Conference	The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015)
Country/Territory	Portugal
City	Lisbon,
Period	20/05/15 → 22/05/15

Access to Document

10.5220/0005498901700178

WEBIST2015_TreeBasedAlgo_CRAccepted author manuscript (Post-print), 444 KB

Cite this

@inbook{1bde735227a1439bb178aedfecf6aa2a,

title = "A tree-based algorithm for ranking web services",

abstract = "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.",

author = "Fatma-Ezzahra Gmati and Nadia Yacoubi-Ayadi and Afef Bahri and Salem Chakhar and Alessio Ishizaka",

year = "2015",

doi = "10.5220/0005498901700178",

language = "English",

isbn = "9789897581069",

pages = "170--178",

editor = "{Monfort }, Val{\'e}rie and Karl-Heinz Krempels",

booktitle = "The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015), Lisbon, Portugal, May 20-22",

publisher = "SciTePress",

note = "The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015) ; Conference date: 20-05-2015 Through 22-05-2015",

}

Gmati, F-E, Yacoubi-Ayadi, N, Bahri, A, Chakhar, S & Ishizaka, A 2015, A tree-based algorithm for ranking web services. in V Monfort & K-H Krempels (eds), The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015), Lisbon, Portugal, May 20-22. SciTePress, pp. 170-178, The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015), Lisbon, Portugal, 20/05/15. https://doi.org/10.5220/0005498901700178

A tree-based algorithm for ranking web services. / Gmati, Fatma-Ezzahra ; Yacoubi-Ayadi, Nadia ; Bahri, Afef et al.
The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015), Lisbon, Portugal, May 20-22. ed. / Valérie Monfort ; Karl-Heinz Krempels. SciTePress, 2015. p. 170-178.

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

TY - CHAP

T1 - A tree-based algorithm for ranking web services

AU - Gmati, Fatma-Ezzahra

AU - Yacoubi-Ayadi, Nadia

AU - Bahri, Afef

AU - Chakhar, Salem

AU - Ishizaka, Alessio

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

U2 - 10.5220/0005498901700178

DO - 10.5220/0005498901700178

M3 - Chapter (peer-reviewed)

SN - 9789897581069

SP - 170

EP - 178

BT - The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015), Lisbon, Portugal, May 20-22

A2 - Monfort , Valérie

A2 - Krempels, Karl-Heinz

PB - SciTePress

T2 - The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015)

Y2 - 20 May 2015 through 22 May 2015

ER -

A tree-based algorithm for ranking web services

Abstract

Conference

Access to Document

Fingerprint

Cite this