考虑用户活跃度和项目流行度的基于项目最近邻的协同-计算机科学.PDF

Vo 1. 43 No. 12 第 43 卷第12 期 计算机科学 2016 年 12 月 Computer Science Dec 2016 考虑用户活跃度和项目流行度的基于项目最近邻的协同过滤算法 王锦坤姜元春1IJ\见山孙春华 (合肥工业大学管理学院 合肥 230009) (过程优化与智能决策教育部重点实验室 合肥 230009) 摘 要 项目相关性度量是基于项目最近邻的协同过滤算法的关键。已有的项目相关性度量方法在数据集稀疏或推 荐低流行度产品时会面临较大挑战，因此提出一种考虑用户活跃度和项目流行度的基于项目最近邻的协同过滤算法。 该算法在度量两个项目的相关性时，若有记录只对两个项目之一有许分，则利用该记录所对应的评分用户的活跃度和 被评价项目的流行度进行相关性惩罚，从而提高数据稀疏环境下低流行度产品被推荐的概率。实验表明，所才是算法在 保证评分预测精度的情况下提升了推荐给采的多样性和新颖性。 关键词 个性化推荐，相关性度量，协同过滤，用户活跃度，项目流行度 中固法分类号 TP391 文献标识码 A DOI 10. 11896/j. issn. 1002-137)♀ 2016.12.028 Item-based Collaborative Filtering Algorithm Integrating User Activity and Item Popularity WANG Jin-kun JIANG Yuan-chun SUN Jian-shan SUN Chun-hua CSchool of Management ,Hefei University of Technology ,Hefei 230009 ,China) (Key Laboratory of Process Optimization and Intelligent Decision-making ,Ministry of Education ,Hefei 230009 ,China) Abstract Item correlation computation is the most critical component in item-based collaborative filtering algorithm. The traditional correlation computation scheme can be challenged by the sparse data set and the situation of recommen ding unpopular products. In this paper ,a novel item-based collaborative filtering algorithm that incorporates the activity of users and popularity of items was proposed. The proposed computation scheme decreases the correlation between items using the activity of users and popularity of items in those rating records where only one item is rated. In this way ,the unpopular products can be recommended to users in the sparse data Experimental evaluation shows that the di