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.

References

  1. Beck, M. and Freitag, B. (2006). Semantic matchmaking using ranked instance retrieval. In Proceedings of the 1st International Workshop on Semantic Matchmaking and Resource Retrieval, Seoul, South Korea.
  2. Bellur, U. and Kulkarni, R. (2007). Improved matchmaking algorithm for semantic web services based on bipartite graph matching. In IEEE International Conference on Web Services, pages 86-93, Salt Lake City, Utah, USA.
  3. Chakhar, S. (2013). Parameterized attribute and service levels semantic matchmaking framework for service composition. In Fifth International Conference on Advances in Databases, Knowledge, and Data Applications (DBKDA 2013), pages 159-165, Seville, Spain.
  4. Chakhar, S., Ishizaka, A., and Labib, A. (2014). Qosaware parameterized semantic matchmaking framework for Web service composition. In Monfort, V. and Krempels, K.-H., editors, WEBIST 2014 - Proceedings of the 10th International Conference on Web Information Systems and Technologies, Volume 1, Barcelona, Spain, 3-5 April, 2014, pages 50-61, Barcelona, Spain. SciTePress.
  5. Chakhar, S., Ishizaka, A., and Labib, A. (2015). Semantic matching-based selection and qos-aware classification of web services. In Selected Papers from The 10th International Conference on Web Information Systems and Technologies (WEBIST 2014), Lecture Notes in Business Information Processing. SpringerVerlag, Berlin, Heidelberg, Germany. forthcoming.
  6. Doshi, P., Goodwin, R., Akkiraju, R., and Roeder, S. (2004). Parameterized semantic matchmaking for workflow composition. IBM Research Report RC23133, IBM Research Division.
  7. Fu, P., Liu, S., Yang, H., and Gu, L. (2009). Matching algorithm of web services based on semantic distance. In International Workshop on Information Security and Application (IWISA 2009), pages 465-468, Qingdao, China.
  8. Gmati, F. E. (2015). Parameterized semantic matchmaking and ranking framework for web service composition. Master thesis, Higher Business School of Tunis (University of Manouba) and Institute of Advanced Business Studies of Carthage (University of Carthage), Tunisia.
  9. Gmati, F. E., Yacoubi-Ayadi, N., Bahri, A., Chakhar, S., and Ishizaka, A. (2015). PMRF: Parameterized matchingranking framework. Studies in Computational Intelligence. Springer. forthcoming.
  10. Gmati, F. E., Yacoubi-Ayadi, N., and Chakhar, S. (2014). Parameterized algorithms for matching and ranking Web services. In Proceedings of the On the Move to Meaningful Internet Systems: OTM 2014 Conferences 2014, volume 8841 of Lecture Notes in Computer Science, pages 784-791. Springer.
  11. Klusch, M., Dudev, M., Misutka, J., Kapahnke, P., and Vasileski, M. (2010). SME2 Version 2.2. User Manual. The German Research Center for Artificial Intelligence (DFKI), Germany.
  12. Kokash, N., Birukou, A., and DAndrea, V. (2007). Web service discovery based on past user experience. In Proceedings of the 10th International Conference on Business Information Systems, pages 95-107.
  13. Kuck, J. and Gnasa, M. (2007). Context-sensitive service discovery meets information retrieval. In Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom'07), pages 601-605.
  14. Kuhn, H. (1955). The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2:83- 97.
  15. Küster, U. and König-Ries, B. (2010). Measures for benchmarking semantic Web service matchmaking correctness. In Proceedings of the 7th International Conference on The Semantic Web: Research and Applications - Volume Part II, ESWC'10, pages 45-59, Berlin, Heidelberg. Springer-Verlag.
  16. Maamar, Z., Mostefaoui, S., and Mahmoud, Q. (2005). Context for personalized Web services. In In Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05), pages 166b166b.
  17. Manikrao, U. and Prabhakar, T. (2005). Dynamic selection of Web services with recommendation system. In Proceedings of the International Conference on Next Generation Web Services Practices (NWeSP 2005), pages 117-121.
  18. Manoharan, R., Archana, A., and Cowla, S. (2011). Hybrid Web services ranking algorithm. International Journal of Computer Science Issues, 8(2):83-97.
  19. Paolucci, M., Kawamura, T., Payne, T., and Sycara, K. (2002). Semantic matching of web services capabilities. In Proceedings of the First International Semantic Web Conference on The Semantic Web, ISWC 7802, pages 333-347, London, UK, UK. Springer-Verlag.
  20. Rong, W., Liu, K., and Liang, L. (2009). Personalized Web service ranking via user group combining association rule. In IEEE International Conference on Web Services (ICWS 20090, pages 445-452.
  21. Segev, A. and Toch, E. (2011). Context based matching and ranking of Web services for composition. IEEE Transactions on Services Computing, 3(2):210-222.
  22. Skoutas, D., Sacharidis, D., Simitsis, A., and Sellis, T. (2010). Ranking and Clustering Web Services Using Multicriteria Dominance Relationships. IEEE Transactions on Services Computing, 3(3):163-177.
Download


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