z-logo
open-access-imgOpen Access
Web Services Recommendation Leveraging Semantic Similarity Computing
Author(s) -
Boran Hu,
Zhangbing Zhou,
Zehui Cheng
Publication year - 2018
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2018.03.041
Subject(s) - computer science , web service , popularity , services computing , world wide web , domain (mathematical analysis) , service (business) , similarity (geometry) , recommender system , variable (mathematics) , information retrieval , artificial intelligence , psychology , social psychology , mathematical analysis , mathematics , economy , economics , image (mathematics)
With the popularity of Web services adopted for supporting domain applications, recommending and composing appropriate services with respect to user requirements is a challenge. This paper proposes a dynamic programming and variable length genetic algorithm for the recommendation and composition of Web services. Generally, starting and ending services are determined leveraging the constructed service network model. Based on which, services are selected and composed, such that these services should be more appropriate on satisfying users’ requirements. Experimental evaluation result shows that our technique is effective and can improve the accuracy of service recommendation.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom