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

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.