Slope One algorithm based on nonnegative matrix factorization

被引:2
作者
Dong L.-Y. [1 ,2 ]
Jin J.-H. [1 ]
Fang Y.-C. [1 ]
Wang Y.-Q. [1 ]
Li Y.-L. [3 ]
Sun M.-H. [1 ,2 ]
机构
[1] College of Computer Science and Technology, Jilin University, Changchun
[2] Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun
[3] School of Information Science and Technology, Northeast Normal University, Changchun
来源
Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science) | 2019年 / 53卷 / 07期
关键词
Collaborative filtering; Non-negative matrix factorization; Recommendation system; Slope One;
D O I
10.3785/j.issn.1008-973X.2019.07.014
中图分类号
学科分类号
摘要
The good performance of matrix decomposition in solving matrix sparsity was used in order to solve the problem that the Slope One algorithm has low recommendation accuracy in the sparse data set in the collaborative filtering recommendation algorithm. The nonnegative matrix factorization technology was introduced into the dimension reduction of the user-item rating matrix in order to optimize the Slope One algorithm. The original sparse scoring matrix was non-negatively decomposed in order to improve the sparsity of the matrix. The experimental results show that the NMF-Slope One algorithm has a good recommendation effect compared with the original CF algorithm. Parameters were determined for experimentation under conditions of sparse data. The proposed method improves the accuracy and the recommendation quality of the Slope One algorithm under data sparseness. © 2019, Zhejiang University Press. All right reserved.
引用
收藏
页码:1349 / 1353and1362
相关论文
共 16 条
[1]  
Cacheda F., Formoso V., Fernandez D., Et al., Comparison of collaborative filtering algorithms: Limitations of current techniques and proposals for scalable, high-performance recommender systems, ACM Transactions on the Web, 5, 1, pp. 1-33, (2011)
[2]  
Lemire D., Maclachlan A., Slope One predictors for online rating-based collaborative filtering, Proceedings of the 2005 SIAM International Conference on Data Mining, pp. 471-475, (2005)
[3]  
Karydi E., Margaritis K.G., Multithreaded implementation of the Slope One algorithm for collaborative filtering, 8th IFIP WG 12.5 International Conference on Artificial Intelligence Applications and Innovations, pp. 117-125, (2012)
[4]  
Koren Y., Bell R., Advances in Collaborative Filtering, pp. 77-118, (2015)
[5]  
Tian S., Ou L., An improved Slope One algorithm combining KNN method weighted by user similarity, 17th International Conference on Web-Age Information Management, pp. 88-98, (2016)
[6]  
Basu A., Vaidya J., Kikuchi H., Perturbation based privacy preserving Slope One predictors for collaborative filtering, 6th IFIP WG 11.11 International Conference on Trust Management VI, pp. 17-35, (2012)
[7]  
Mao C., Chen J., QoS prediction for web services based on similarity-aware Slope One collaborative filtering, Informatica (Slovenia), 37, 2, pp. 139-148, (2013)
[8]  
Liu Y., Liu D., Xie H., Et al., A research on the improved slope one algorithm for collaborative filtering, International Journal of Computing Science and Mathematics, 7, 3, pp. 245-253, (2016)
[9]  
Saeed M., Mansoori E.G., A new slope one based recommendation algorithm using virtual predictive items, Journal of Intelligent Information Systems, 50, 3, pp. 527-547, (2018)
[10]  
Wang Q.X., Luo X., Li Y., Et al., Incremental Slope-one recommenders, Neurocomputing, 272, pp. 606-618, (2018)