Time Aware and Data Sparsity Tolerant Web Service Recommendation Based on Improved Collaborative Filtering

With the incessant growth of web services on the Internet, how to design effective web service recommendation technologies based on Quality of Service (QoS) is becoming more and more important. Web service recommendation can relieve users from tough work on service selection and improve the efficiency of developing service-oriented applications. Neighborhood-based collaborative filtering has been widely used for web service recommendation, in which similarity measurement and QoS prediction are two key issues. However, traditional similarity models and QoS prediction methods rarely consider the influence of time information, which is an important factor affecting the QoS performance of web services. Furthermore, it is difficult for the existing similarity models to capture the actual relationships between users or services due to data sparsity. The two shortcomings seriously devalue the performance of neighborhood-based collaborative filtering. In this paper, the authors propose an improved time-aware collaborative filtering approach for high-quality web service recommendation. Our approach integrates time information into both similarity measurement and QoS prediction. Additionally, in order to alleviate the data sparsity problem, a hybrid personalized random walk algorithm is designed to infer indirect user similarities and service similarities. Finally, a series of experiments are provided to validate the effectiveness of our approach.

[1]  David Heckerman,et al.  Empirical Analysis of Predictive Algorithms for Collaborative Filtering , 1998, UAI.

[2]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[3]  John F. Canny,et al.  Collaborative filtering with privacy via factor analysis , 2002, SIGIR '02.

[4]  Thomas Hofmann,et al.  Latent semantic models for collaborative filtering , 2004, TOIS.

[5]  George Karypis,et al.  Item-based top-N recommendation algorithms , 2004, TOIS.

[6]  Luo Si,et al.  An automatic weighting scheme for collaborative filtering , 2004, SIGIR '04.

[7]  Dimitris Plexousakis,et al.  Alleviating the Sparsity Problem of Collaborative Filtering Using Trust Inferences , 2005, iTrust.

[8]  C. Willmott,et al.  Advantages of the mean absolute error (MAE) over the root mean square error (RMSE) in assessing average model performance , 2005 .

[9]  Franco Scarselli,et al.  Inside PageRank , 2005, TOIT.

[10]  Amy Nicole Langville,et al.  Google's PageRank and beyond - the science of search engine rankings , 2006 .

[11]  Pang-Ning Tan,et al.  Recommendation via Query Centered Random Walk on K-Partite Graph , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[12]  Christos Faloutsos,et al.  Random walk with restart: fast solutions and applications , 2008, Knowledge and Information Systems.

[13]  Aristides Gionis,et al.  The query-flow graph: model and applications , 2008, CIKM '08.

[14]  Mukkai S. Krishnamoorthy,et al.  A random walk method for alleviating the sparsity problem in collaborative filtering , 2008, RecSys '08.

[15]  Hyung Jun Ahn,et al.  A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem , 2008, Inf. Sci..

[16]  Zibin Zheng,et al.  WSRec: A Collaborative Filtering Based Web Service Recommender System , 2009, 2009 IEEE International Conference on Web Services.

[17]  Mingdong Tang,et al.  An Effective Web Service Recommendation Method Based on Personalized Collaborative Filtering , 2011, 2011 IEEE International Conference on Web Services.

[18]  Zibin Zheng,et al.  WSPred: A Time-Aware Personalized QoS Prediction Framework for Web Services , 2011, 2011 IEEE 22nd International Symposium on Software Reliability Engineering.

[19]  Zibin Zheng,et al.  QoS-Aware Web Service Recommendation by Collaborative Filtering , 2011, IEEE Transactions on Services Computing.

[20]  Sangkeun Lee,et al.  Random walk based entity ranking on graph for multidimensional recommendation , 2011, RecSys '11.

[21]  Fei Wang,et al.  Social recommendation across multiple relational domains , 2012, CIKM.

[22]  Mingdong Tang,et al.  Location-Aware Collaborative Filtering for QoS-Based Service Recommendation , 2012, 2012 IEEE 19th International Conference on Web Services.

[23]  Yuxin Mao,et al.  Personalized Services Recommendation Based on Context-Aware QoS Prediction , 2012, 2012 IEEE 19th International Conference on Web Services.

[24]  Chih-Fong Tsai,et al.  Cluster ensembles in collaborative filtering recommendation , 2012, Appl. Soft Comput..

[25]  Sanjeev R. Kulkarni,et al.  A randomwalk based model incorporating social information for recommendations , 2012, 2012 IEEE International Workshop on Machine Learning for Signal Processing.

[26]  Hervé Verjus,et al.  QoS aggregation for service orchestrations based on workflow pattern rules and MCDM method: evaluation at design time and runtime , 2012, Service Oriented Computing and Applications.

[27]  Chuang Lin,et al.  Agent-Based Green Web Service Selection and Dynamic Speed Scaling , 2013, 2013 IEEE 20th International Conference on Web Services.

[28]  Zibin Zheng,et al.  Personalized QoS-Aware Web Service Recommendation and Visualization , 2013, IEEE Transactions on Services Computing.

[29]  Lina Yao,et al.  Recommending Web Services via Combining Collaborative Filtering with Content-Based Features , 2013, 2013 IEEE 20th International Conference on Web Services.

[30]  Yang Zhou,et al.  Ranking Services by Service Network Structure and Service Attributes , 2013, 2013 IEEE 20th International Conference on Web Services.

[31]  Liang Cai,et al.  Geographic Location-Based Network-Aware QoS Prediction for Service Composition , 2013, 2013 IEEE 20th International Conference on Web Services.

[32]  Daniel Dajun Zeng,et al.  A Random Walk Model for Item Recommendation in Social Tagging Systems , 2013, TMIS.

[33]  Zibin Zheng,et al.  Web Service Recommendation via Exploiting Location and QoS Information , 2014, IEEE Transactions on Parallel and Distributed Systems.