Reference Hub3
A Service Recommendation Algorithm Based on Modeling of Dynamic and Diverse Demands

A Service Recommendation Algorithm Based on Modeling of Dynamic and Diverse Demands

Yanmei Zhang, Tingpei Lei, Zhiguang Qin
Copyright: © 2018 |Volume: 15 |Issue: 1 |Pages: 24
ISSN: 1545-7362|EISSN: 1546-5004|EISBN13: 9781522542445|DOI: 10.4018/IJWSR.2018010103
Cite Article Cite Article

MLA

Zhang, Yanmei, et al. "A Service Recommendation Algorithm Based on Modeling of Dynamic and Diverse Demands." IJWSR vol.15, no.1 2018: pp.47-70. http://doi.org/10.4018/IJWSR.2018010103

APA

Zhang, Y., Lei, T., & Qin, Z. (2018). A Service Recommendation Algorithm Based on Modeling of Dynamic and Diverse Demands. International Journal of Web Services Research (IJWSR), 15(1), 47-70. http://doi.org/10.4018/IJWSR.2018010103

Chicago

Zhang, Yanmei, Tingpei Lei, and Zhiguang Qin. "A Service Recommendation Algorithm Based on Modeling of Dynamic and Diverse Demands," International Journal of Web Services Research (IJWSR) 15, no.1: 47-70. http://doi.org/10.4018/IJWSR.2018010103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This article contends that current service recommendation algorithms are still unable to meet the dynamic and diverse demands of users, so a service recommendation algorithm considering dynamic and diverse demands is proposed. The latent Dirichlet allocation model of machine learning field is adopted to extract the user implicit demand factors, and then the bipartite graph modeling and random-walk algorithm are used to extend implicit demand factors to predict short-term changes and diversity of user demand. At last, the service recommendation list is generated based on these demand factors. Experimental results on a real-world data set regarding service composition show that the proposed algorithm can represent dynamic and diverse user demands, and the performance of the proposed algorithm is better than that of the other algorithms in terms of accuracy, novelty, and diversity.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.