期刊文献+

一种2阶段联合预测的协同过滤推荐算法

Research on a Collaborative Filtering Recommendation Algorithm Based on Two-stage Joint Prediction
下载PDF
导出
摘要 传统协同过滤推荐算法存在评分数据稀疏性、用户评分偏好缺失性、传统相似性度量局限性的问题.提出一种基于物品预测得分与基于用户偏好得分的2阶段联合推荐算法:第1阶段,使用基于物品的预测得分补全评分矩阵,利用时间权重因子改进物品相似度;第2阶段,先利用评分偏好模型将完整的评分矩阵转化为针对评分类别的用户评分偏好矩阵,再通过该矩阵使用基于用户的协同过滤算法计算偏好得分,利用用户共同评分数权重改进用户相似度,最后将基于物品的预测得分联合基于用户的偏好得分作为目标用户的综合预测评分.实验结果表明,在不同近邻用户数和不同推荐列表长度下,该算法的准确率和召回率均优于传统协同过滤算法,且针对不同稀疏度数据集,该算法的MAE增量值降低了8%~24.6%,具有更高的推荐精度和准确度. Traditional collaborative filtering recommendation algorithm has some problems,such as the sparsity of rating data,the lack of user rating preference,and the limitation of traditional similarity measurement.In this paper,a two-stage recommendation model combining item prediction score and user preference score is proposed.In the first stage,the item-based prediction score is used to complete the score matrix,and the time weight factor is used to improve the item similarity;In the second stage,the complete scoring matrix is transformed into a user scoring preference matrix for scoring categories by using the scoring preference model,then the preference score is calculated by using the user-based collaborative filtering algorithm through the matrix,and the user common rating score weight is used to improve the user similarity.Finally,the item-based prediction score and the user-based preference score are used as the comprehensive prediction score of the target user.Experimental results show that the proposed algorithm outperforms the traditional collaborative filtering algorithm in terms of accuracy and recall rate under different number of neighbor users and different lengths of recommendation list.Moreover,for different sparsity data sets,the MAEincrement value of the proposed algorithm is reduced by 8%-24.6%,with higher recommendation precision and accuracy.
作者 杨北辰 余粟 陈乐 Yang Beichen;Yu Su;Chen Le(School of Electrical&Electronic Engineering,Shanghai University of Engineering Science,Shanghai 201620)
出处 《信息安全研究》 CSCD 2023年第3期291-297,共7页 Journal of Information Security Research
基金 国家科技部“十二五”支撑计划项目(2015BAF10B00) 上海市科学技术委员会基金项目(17511110204)。
关键词 推荐系统 协同过滤 相似性度量 评分偏好 稀疏度 recommendation system collaborative filtering similarity measurement rating preference sparsity
  • 相关文献

参考文献13

二级参考文献145

  • 1杨博,赵鹏飞.推荐算法综述[J].山西大学学报(自然科学版),2011,34(3):337-350. 被引量:86
  • 2江志恒,刘乃芩.论遗忘函数——关于记忆心理学的数学讨论[J].心理科学进展,1988(3):56-60. 被引量:13
  • 3张锋,常会友.使用BP神经网络缓解协同过滤推荐算法的稀疏性问题[J].计算机研究与发展,2006,43(4):667-672. 被引量:85
  • 4Sarwar B,Karypis G,Konstan J,Reidl J.Item-based collaborative filtering recommendation algorithms//Proceedings of the 10th International Conference on World Wide Web.Hong Kong,China,2001:285-295.
  • 5Deshpande M,Karypis G.Item-based top-n recommendation algorithms.ACM Transactions on Information Systems,2004,22(1):143-177.
  • 6Bell R M,Koren Y.Improved neighborhood-based collaborative filtering//Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.California,2007:7-14.
  • 7Koren Y.Factor in the Neighbors:Scalable and accurate collaborative filtering.ACM Transactions on Knowledge Discovery from Data,2009,4(1):1-24.
  • 8Kurucz M,Benczúr A A,Csalogny K.Methods for large scale SVD with missing values//KDD Cup Workshop at Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.California,2007:31-38.
  • 9Paterek A.Improving regularized singular value decomposition for collaborative filtering//KDD Cup Workshop at Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.California,2007:39-42.
  • 10Takcs G,Pilszy I,Németh B,Tikky D.Investigation of various matrix factorization methods for large recommender systems//Proceedings of the 2nd KDD Workshop on Large-Scale Recommender Systems and the Netflix Prize Competition,2008:1-8.

共引文献801

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部