Incorporating Service Proximity Into Web Service Recommendation Via Tensors Decomposition
MetadataShow full metadata
The sparseness of Mashup-API rating matrix coupled with cold-start and scalability issues have been identiﬁed as the most critical challenges that affect most Collaborative ﬁltering based Web APIs recommendation solution. Sparseness deteriorates the rating prediction accuracy. Several Web-API recommendation approaches employ basic collaborative ﬁltering technique which operates on second-order matrices or tensors by decomposing the Mashup-API interaction matrix into two low-rank matrix approximations, and then make prediction based on the factorized tensors. While most existing CF, Matrix factorization-based Web-API recommendation approaches have shown promising improvement in recommendation results, one limitation is that they only focuson2-dimensionaldatamodelinwhichhistoricalinteractionbetweenMashup-API are mainly used. However, recent works in recommendation domain show that by incorporating additional information into the rating data, Web-API rating prediction accuracy can be enhanced. Inspired by these works, this research proposes a collaborative Filtering method based Tensors factorization, an extension of Matrix factorization that exploits the ternary relation among three key entities in Web service ecosystem Mashup-API-Proximity. Modelling the Web-API rating data with Tensor decomposition technique enables incorporation proximity information as third additional entity into Web service recommendation application to improve prediction accuracy. Speciﬁcally, we employ High Order Singular Value Decomposition approach with regularization term to extend the traditional Mashup-API matrix into Mashup-API-Proximity tensors. 5 Experimental analysis on Programmable Web dataset shows promising results compare with some state-of-the-art approaches.