期刊文献+

融合用户兴趣分布变化和特征差异的协同过滤推荐算法

Collaborative filtering recommendation algorithm combined with user interest change of distribution and characteristic difference
下载PDF
导出
摘要 针对传统协同过滤算法没有考虑由时间引起的用户兴趣分布变化、致使其推荐精度不高的问题,提出了融合用户兴趣分布变化和特征差异的协同过滤推荐算法。采用窗方法估计用户在整个项目空间上的兴趣分布,设计时间遗忘曲线因子用以确定用户兴趣分布变化函数,最后结合兴趣分布变化相对熵和用户特征差异计算用户相似程度并进行项目推荐。实验结果表明,该算法能够有效追踪用户对项目兴趣变化,提高了数据稀疏情况下的推荐精度。 Aiming at the problem that traditional collaborative filtering recommendation algorithm failed to consider user interest change of distribution to cause poor recommending precision, a collaborative filtering recommendation algorithm combined with user interest change of distribution and characteristic difference is proposed in this paper. Window estimation method is applied to get user interest distribution in total item space, and the factor of time forgetting curve is designed to define the function of user interest change of distribution. Finally, by combining Kullback-Leibler divergence of user interest change of distribution and characteristic difference, user similarity is calculated to finish the item recommendation. Experimental result shows that the algorithm can effectively trace the interest change of distribution and raise the recommendation precision.
作者 毕孝儒 Bi Xiaoru(School of International Business and Management, Chongqing South translation college of University of SISU, Chongqing 401120, China)
出处 《计算机时代》 2019年第1期71-74,共4页 Computer Era
基金 四川外国语大学重庆南方翻译学院科研项目(No.KY2017005) 重庆市教育委员会自然科学技术项目(No.KJ1602101)
关键词 协同推荐 兴趣分布变化 相对熵 特征差异 collaborative filtering recommendation user interest change of distribution Kullback-Leibler divergence characteristic difference
  • 相关文献

参考文献2

二级参考文献22

  • 1张锋,常会友.使用BP神经网络缓解协同过滤推荐算法的稀疏性问题[J].计算机研究与发展,2006,43(4):667-672. 被引量:85
  • 2Resnick P,Iacovou N,Suchak M,et al. GroupLens:Anopen architecture for collaborative filtering of netnews [C] //Proc of the 1994 ACM Conf on Computer SupportedCooperative Work. New York:ACM,1994:175-186.
  • 3Hill W,Stead L,Rosenstein M,et al. Recommending andevaluating choices in a virtual community of use [C] //Proc ofthe SIGCHI Conf on Human Factors in Computing Systems.New York:ACM,1995:194-201.
  • 4Sarwar B,Karypis G,Konstan J,et al. Item-basedcollaborative filtering recommendation algorithms [C] //Procof the 10th Int Conf on World Wide Web. New York:ACM,2001; 285-295.
  • 5Shi Y,Larson M,Hanjalic A. Exploiting user similaritybased on rated-item pools for improved user-basedcollaborative filtering [C] //Proc of the 3rd ACM Conf onRecommender Systems. New York:ACM,2009:125-132.
  • 6Kamishima T,Akaho S. Nantonac collaborative filtering:amodel-based approach [C] //Proc of the 4th ACM Odii? onRecommender Systems. New York:ACM,2010:273-276.
  • 7Zhou Ke,Yang Shuanghong,Zha Hongyuan. Functionalmatrix factorizations for cold-start recommendation [C] //Proc of the 34th Int ACM SIGIR Conf on Research andDevelopment in Information Retrieval. New York:ACM,2011:315-324.
  • 8Wolpert D H,Macready W G. No free lunch theorems foroptimization [J]. IEEE Trans on Evolutionary Computation,1997,HI):67-82.
  • 9Deshpande M,Karypis G. Item-based top-N recommendationalgorithms [J]. ACM Trans on Information Systems,2004,22(1):143-177.
  • 10Breese J S,Heckerman D,Kadie C,Empirical analysis ofpredictive algorithms for collaborative filtering [C] //Proc ofthe 14th Annual Conf on Uncertainty in ArtificialIntelligence. San Francisco:Morgan Kaufmann,199B:43-52.

共引文献43

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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