返回
Singular value decomposition based recommendation using imputed data
DOI:10.1016/j.knosys.2018.09.011.png)
摘要
En 中文
Among widely used recommendation methods, singular value decomposition (SVD) based approaches are the most successful ones. Although SVD-based methods are effective, they suffer from the problem of data sparsity, which could lead to poor recommendation quality. This paper proposes a novel imputation based recommendation method, called the imputation-based SVD (ISVD), to solve the problem of data sparsity in SVD-based methods. Firstly, we propose a neighbor selection algorithm based on a similarity measure for users and items. In this algorithm, we set two thresholds to select effective neighbors for each user and item. Secondly, we generate the imputed data according to the neighbors' ratings. Finally, we imputed these data into the SVD framework. By using imputed training data in SVD, our method can learn the prediction model accurately. We have tested our method on the MovieLens 100k, MovieLens 1M, Netflix and Filmtrust datasets. Experiment results show that our method outperforms the state-of-the-art ones. This study not only offers new insights into generating imputed data but also provides a guide to the alleviation of data sparsity in SVD-based methods. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Imputation-based recommendation
SVD-based recommendation
Data sparsity
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Evaluating collaborative filtering recommendations inside large learning object repositories在大型学习对象存储库中评估协同过滤推荐
Dealing with the new user cold-start problem in recommender systems: A comparative review推荐系统中新用户冷启动问题的处理: 比较综述

