吉林大学学报(理学版)

• 计算机科学 • 上一篇    下一篇

基于抽样近邻的协同过滤算法

董立岩1, 刘晋禹1, 蔡观洋1, 李永丽2   

  1. 1. 吉林大学 计算机科学与技术学院, 长春 130012; 2. 东北师范大学 计算机科学与信息技术学院, 长春 130117
  • 收稿日期:2014-05-14 出版日期:2014-07-26 发布日期:2014-09-26
  • 通讯作者: 李永丽 E-mail:Liyl603@nenu.edu.cn

Collaborative Filtering Algorithm Based on Sampling Neighbor

DONG Liyan1, LIU Jinyu1, CAI Guanyang1, LI Yongli2   

  1. 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China;2. School of Computer Science and Technology, Northeast
     Normal University, Changchun 130117, China
  • Received:2014-05-14 Online:2014-07-26 Published:2014-09-26
  • Contact: LI Yongli E-mail:Liyl603@nenu.edu.cn

摘要:

针对实时推荐过程中实际数据的稀疏性, 满足条件的项目或用户较少, 导致推荐精度较低的问题, 提出一种采用抽样近邻的协同过滤算法. 该算法充分利用评分用户矩阵提供的信息, 增加了参与到预测评分计算过程中的用户或项目, 从而解决了传统协同过滤算法在实际应用中的不足. 实验结果表明, 在增加在线计算时间较少的情况下所给算法可有效提高推荐精度.

关键词: 协同过滤, 稀疏矩阵, 推荐精度, 近邻

Abstract:

Since the useritem matrix is sparse, and there are less users or items satisfying the conditions, the precision of the algorithm can’t be high. By sampling neighbor collaborative filtering algorithms, users take full advantage of score matrix provided information to increase the users or projects participated in the calculation process, so as to solve the shortage of traditional collaborative filtering algorithms in real application. Experiment results show that the new algorithm can effectively improve the precision in recommendation along a small increasing of runtime.

Key words: collaborative filtering, sparse matrix, precision of recommendation, neighbor

中图分类号: 

  • TP301.6