Service Recommendation for Mashup Composition with Implicit Correlation Regularization

In this paper, we explore service recommendation and selection in the reusable composition context. The goal is to aid developers finding the most appropriate services in their composition tasks. We specifically focus on mashups, a domain that increasingly targets people without sophisticated programming knowledge. We propose a probabilistic matrix factorization approach with implicit correlation regularization to solve this problem. In particular, we advocate that the co-invocation of services in mashups is driven by both explicit textual similarity and implicit correlation of services, and therefore develop a latent variable model to uncover the latent connections between services by analyzing their co-invocation patterns. We crawled a real dataset from Programmable Web, and extensively evaluated the effectiveness of our proposed approach.

[1]  Chao Liu,et al.  Recommender systems with social regularization , 2011, WSDM '11.

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

[3]  Quan Z. Sheng,et al.  ' s personal copy Web services composition : A decade ’ s overview , 2014 .

[4]  Nikolay Mehandjiev,et al.  Multi-criteria service recommendation based on user criteria preferences , 2011, RecSys '11.

[5]  Athman Bouguettaya,et al.  Deploying and managing Web services: issues, solutions, and directions , 2008, The VLDB Journal.

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

[7]  Buqing Cao,et al.  CSCF: A Mashup Service Recommendation Approach based on Content Similarity and Collaborative Filtering , 2014 .

[8]  Jennifer Neville,et al.  Modeling relationship strength in online social networks , 2010, WWW '10.

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

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

[11]  Cesare Pautasso,et al.  Information Quality in Mashups , 2010, IEEE Internet Computing.

[12]  Mark S. Granovetter.  T H E S T R E N G T H O F WEAK TIES: A NETWORK THEORY REVISITED , 1983 .

[13]  Martin Ester,et al.  A matrix factorization technique with trust propagation for recommendation in social networks , 2010, RecSys '10.

[14]  Patrick Seemann,et al.  Matrix Factorization Techniques for Recommender Systems , 2014 .

[15]  Nathan Srebro,et al.  Fast maximum margin matrix factorization for collaborative prediction , 2005, ICML.

[16]  Zibin Zheng,et al.  Trace Norm Regularized Matrix Factorization for Service Recommendation , 2013, 2013 IEEE 20th International Conference on Web Services.

[17]  Ruslan Salakhutdinov,et al.  Probabilistic Matrix Factorization , 2007, NIPS.

[18]  Xiaofei Xu,et al.  Semi-empirical Service Composition: A Clustering Based Approach , 2011, 2011 IEEE International Conference on Web Services.

[19]  Gerard Salton,et al.  Research and Development in Information Retrieval , 1982, Lecture Notes in Computer Science.

[20]  Min Zhao,et al.  Adapting neighborhood and matrix factorization models for context aware recommendation , 2010, RecSys 2010.

[21]  Minglu Li,et al.  A Social-Aware Service Recommendation Approach for Mashup Creation , 2013, 2013 IEEE 20th International Conference on Web Services.

[22]  Thomas Hofmann,et al.  Probabilistic latent semantic indexing , 1999, SIGIR '99.

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

[24]  Zhaohui Wu,et al.  An Extended Matrix Factorization Approach for QoS Prediction in Service Selection , 2012, 2012 IEEE Ninth International Conference on Services Computing.

[25]  Zibin Zheng,et al.  Collaborative Web Service QoS Prediction via Neighborhood Integrated Matrix Factorization , 2013, IEEE Transactions on Services Computing.