A Tree-based Algorithm for Ranking Web Services

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

2015

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.

Paper Citation

in Harvard Style

Ezzahra Gmati F., Yacoubi-Ayad N., Bahri A., Chakhar S. and Ishizaka A. (2015). A Tree-based Algorithm for Ranking Web Services . In Proceedings of the 11th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 978-989-758-106-9, pages 170-178. DOI: 10.5220/0005498901700178

in Bibtex Style

@conference{webist15,
author={Fatma Ezzahra Gmati and Nadia Yacoubi-Ayad and Afef Bahri and Salem Chakhar and Alessio Ishizaka},
title={A Tree-based Algorithm for Ranking Web Services},
booktitle={Proceedings of the 11th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2015},
pages={170-178},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005498901700178},
isbn={978-989-758-106-9},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 11th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - A Tree-based Algorithm for Ranking Web Services
SN - 978-989-758-106-9
AU - Ezzahra Gmati F.
AU - Yacoubi-Ayad N.
AU - Bahri A.
AU - Chakhar S.
AU - Ishizaka A.
PY - 2015
SP - 170
EP - 178
DO - 10.5220/0005498901700178