返回
Preliminary data-based matrix factorization approach for recommendation
DOI:10.1016/j.ipm.2020.102384.png)
摘要
En 中文
Existing collaborative filtering algorithms suffer from the problem of data sparsity. Imputation based methods are promising algorithms, which alleviate data sparsity without using side information, to solve this problem. However, existing imputation recommendation methods based on matrix factorization only separately factorize the rating matrix and the imputed data matrix, which limits the power of imputed data. In this paper, we propose an efficient method, which can make full use of the imputed data, to alleviate data sparsity. Firstly, our method, called Preliminary Data-based Matrix Factorization (PDMF), generates preliminary prediction data based on neighborhood-based methods. Secondly, PDMF consists of two models of learning the user and item preferences. One firstly makes the original preferences get close to preliminary preferences, and then creates the concatenated preferences. The other one creates the concatenated preferences firstly, and then makes the original, preliminary and concatenated preferences get close to each other. To the best of our knowledge, our method is the first to constrain the learning procedure in matrix factorization by using imputed data. We test our method on the MovieLens100k, MovieLens1M, Netflix, Filmtrust and Jester datasets. Experiment results show that the PDMF outperforms the state-of-the-art methods in recommendation accuracy.
Keyword:
Matrix factorization
Neighborhood
Preliminary data
Preference constraint
Sparsity alleviating
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
6.9
论文数:
5.2K
被引数:
1.4W
机构
引用论文
Next-Item Recommendation via Collaborative Filtering with Bidirectional Item Similarity基于双向项目相似性的协同过滤下一项目推荐
Evaluating collaborative filtering recommendations inside large learning object repositories在大型学习对象存储库中评估协同过滤推荐
Content-aware point-of-interest recommendation based on convolutional neural network
APPLIED INTELLIGENCE
IF3.5

