首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于情景的协同过滤推荐算法
引用本文:李荟,谢强,丁秋林.一种基于情景的协同过滤推荐算法[J].计算机技术与发展,2014(10):42-46.
作者姓名:李荟  谢强  丁秋林
作者单位:南京航空航天大学计算机科学与技术学院,江苏南京210016
基金项目:江苏省产学研联合创新资金项目(SBY201320423)
摘    要:针对协同过滤推荐算法中数据极端稀疏所带来的推荐精度低下的问题,文中提出一种基于情景的协同过滤推荐算法。通过引入项目情景相似度的概念,基于项目情景相似度改进了用户之间相似度的计算公式,并将此方法应用至用户离线聚类过程中,最终利用用户聚类矩阵和用户评分数据产生在线推荐。实验结果表明,该算法能够在数据稀疏的情况下定位目标用户的最近邻,一定程度上缓解数据极端稀疏性引起的问题,并减少系统在线推荐的时间。

关 键 词:推荐系统  情景  协同过滤  稀疏性  聚类

A Collaborative Filtering Recommendation Algorithm Based on Scenario
LI Hui,XIE Qiang,DING Qiu-lin.A Collaborative Filtering Recommendation Algorithm Based on Scenario[J].Computer Technology and Development,2014(10):42-46.
Authors:LI Hui  XIE Qiang  DING Qiu-lin
Affiliation:(College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China)
Abstract:The extremely sparse data in collaborative filtering recommendation algorithm often causes the decline of recommendation's precision. In order to solve the problem,suggest a new collaborative filtering recommendation algorithm based on scenario. By introducing the concept of item's scenario-similarity,modify the formula of similarity between users is improved based on item scenario similarity, and then the method has been applied in the procedure of user-clustering in the offline phase and recommendation in the online phase is produced with user-clustering matrix and user evaluation data. The experimental results show that the algorithm can locate the nearest neighbor for target in the condition of sparse data,alleviating some sparsity problem and reducing the time of recommendation in the on-line phase.
Keywords:recommendation system  scenario  collaborative filtering  sparsity  clustering
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号