作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程

• 先进计算 • 上一篇    下一篇

基于评分矩阵填充与用户兴趣的协同过滤推荐算法

韩亚楠,曹菡,刘亮亮   

  1. (陕西师范大学计算机科学学院,西安 710062)
  • 收稿日期:2014-12-19 出版日期:2016-01-15 发布日期:2016-01-15
  • 作者简介:韩亚楠(1988-),男,硕士研究生,主研方向为高性能计算、数据挖掘;曹菡(通讯作者),教授、博士;刘亮亮,硕士研究生。
  • 基金资助:
    国家自然科学基金资助项目(41271387);西安市科技计划基金资助项目(SF1228-3);陕西师范大学院士创新基金资助项目(999521)。

Collaborative Filtering Recommendation Algorithm Based on Score Matrix Filling and User Interest

HAN Yanan,CAO Han,LIU Liangliang   

  1. (School of Computer Science,Shaanxi Normal University,Xi’an 710062,China)
  • Received:2014-12-19 Online:2016-01-15 Published:2016-01-15

摘要: 针对传统协同过滤推荐算法评分矩阵稀疏和推荐精度不高的问题,提出一种改进的协同过滤推荐算法。通过用户属性偏好和项目流行度计算用户对项目的偏好度,结合用户平均评分对评分矩阵中未评分项目进行填充。考虑到用户兴趣随时间的变化,将基于时间的兴趣度权重 函数和偏好度引入到项目相似度计算和推荐过程中,确定项目最近邻集合,从而实现最优推荐。实验结果表明,与传统协同过滤推荐算法相比,该算法较准确地反映了用户的兴趣变化趋势,并且在有效解决评分矩阵稀疏问题的同时提高了推荐准确率。

关键词: 协同过滤, 用户兴趣, 用户偏好度, 项目流行度, 矩阵填充

Abstract: For the traditional collaborative filtering recommendation algorithm meets with low recommendation accuracy and sparse matrix problem.An improved collaborative filtering recommendation algorithm is proposed.It integrates user preference on item attribute and item popularity to compute the user preference degree on item,and fills the unrated-items through the sum of user preference value and average score of users.It takes user interests change over time into account,then the time function as a weight factor in similarity calculation and recommendation process is used to find nearest neighbor set,and it achieves the optimal recommendation.Experimental result shows that this algorithm accurately reflects the change trends of user interest,and not only alleviates the sparsity matrix problem effectively,but also improves recommendation accuracy.

Key words: collaborative filtering, user interest, user preference degree, item popularity, matrix filling

中图分类号: