Recommendation using DMF-based fine tuning method

Publisher:
Springer
Publication Type:
Journal Article
Citation:
Journal of Intelligent Information Systems, 2016, 47 pp. 233 - 246
Issue Date:
2016-04-16
Full metadata record
Files in This Item:
Filename Description Size
2-s2.0-84963773589 am.pdfAccepted Manuscript Version1.27 MB
Adobe PDF
© 2016 Springer Science+Business Media New York Recommender Systems (RS) have been comprehensively analyzed in the past decade, Matrix Factorization (MF)-based Collaborative Filtering (CF) method has been proved to be an useful model to improve the performance of recommendation. Factors that inferred from item rating patterns shows the vectors which are useful for MF to characterize both items and users. A recommendation can concluded from good correspondence between item and user factors. A basic MF model starts with an object function, which is consisted of the squared error between original training matrix and predicted matrix as well as the regularization term (regularization parameters). To learn the predicted matrix, recommender systems minimize the squared error which has been regularized. However, two important details have been ignored: (1) the predicted matrix will be more and more accuracy as the iterations carried out, then a fix value of regularization parameters may not be the most suitable choice. (2) the final distribution trend of ratings of predicted matrix is not similar with the original training matrix. Therefore, we propose a Dynamic-MF algorithm and fine tuning method which is quite general to overcome the mentioned detail problems. Some other information, such as social relations, etc, can be easily incorporated into this method (model). The experimental analysis on two large datasets demonstrates that our approaches outperform the basic MF-based method.
Please use this identifier to cite or link to this item: