基于信息熵和时效性的协同过滤推荐

doi:10.11772/j.issn.1001-9081.2016.09.2531

计算机应用 ›› 2016, Vol. 36 ›› Issue (9): 2531-2534.DOI: 10.11772/j.issn.1001-9081.2016.09.2531

基于信息熵和时效性的协同过滤推荐

刘江冬, 梁刚, 冯程, 周泓宇

四川大学计算机学院, 成都 610065

收稿日期:2015-12-18 修回日期:2016-03-17 出版日期:2016-09-10 发布日期:2016-09-08
通讯作者: 梁刚
作者简介:刘江冬(1989-),男,湖北荆门人,硕士研究生,主要研究方向:机器学习、推荐系统;梁刚(1976-),男,四川成都人,讲师,博士,主要研究方向:机器学习、智能计算;冯程(1991-),男,贵州遵义人,硕士研究生,主要研究方向:机器学习、谣言检测;周泓宇(1990-),男,重庆人,硕士研究生,主要研究方向:数据分析。

Collaborative filtering recommendation based on entropy and timeliness

LIU Jiangdong, LIANG Gang, FENG Cheng, ZHOU Hongyu

College of Computer Science, Sichuan University, Chengdu Sichuan 610065, China

Received:2015-12-18 Revised:2016-03-17 Online:2016-09-10 Published:2016-09-08

摘要/Abstract

摘要： 针对协同过滤推荐算法存在的噪声数据问题，提出了用户信息熵模型。用户信息熵模型结合信息论中信息熵的概念，采用信息熵的大小衡量用户信息的含量，利用用户评分数据得到用户的信息熵，过滤信息熵低的用户，从而达到过滤噪声数据的目的。同时，将用户信息熵模型和项目时效性模型相结合，项目时效性模型利用评分数据上下文信息获得项目的时效性，能有效缓解协同过滤的数据稀疏性问题。实验结果表明提出的算法能有效过滤噪声数据，提高推荐精度，与基础算法相比，推荐精度提高了1.1%左右。

Abstract: Aiming at the noise data problem in collaborative filtering recommendation, a user entropy model was put forward. The user entropy model combined the concept of entropy in the information theory and used the information entropy to measure the content of user information, which filtered the noise data by calculating the entropy of users and getting rid of the users with low entropy. Meanwhile, combining the user entropy model with the item timeliness model, the item timeliness model got the timeliness of item by using the contextual information of the rating data, which alleviated the data sparsity problem in collaborative filtering algorithm. The experimental results show that the proposed algorithm can effectively filter out noise data and improve the recommendation accuracy, its recommendation precision is increased by about 1.1% compared with the basic algorithm.

Key words: recommender system, collaborative filtering, noise data, data sparsity, information entropy, timeliness

中图分类号:

TP181

刘江冬, 梁刚, 冯程, 周泓宇. 基于信息熵和时效性的协同过滤推荐[J]. 计算机应用, 2016, 36(9): 2531-2534.

LIU Jiangdong, LIANG Gang, FENG Cheng, ZHOU Hongyu. Collaborative filtering recommendation based on entropy and timeliness[J]. Journal of Computer Applications, 2016, 36(9): 2531-2534.

参考文献

[1] 许海玲,吴潇,李晓东,等.互联网推荐系统比较研究[J].软件学报,2009,20(2):350-362.(XU H L, WU X, LI X D, et al. Comparison study of Internet recommendation system [J]. Journal of Software, 2009, 20(2): 350-362.)
[2] RESNICK P, VARIAN H R. Recommender system [J]. Communications of the ACM, 1997, 40(3): 56-58.
[3] CHU W, PARK S T. Personalized recommendation on dynamic con-tents using predictive bilinear models [C]// WWW 2009: Proceedings of the 2009 18th International Conference on World Wide Web. New York: ACM, 2009: 691-700.
[4] 孟祥武,刘树栋,张玉洁,等.社会化推荐系统研究[J].软件学报,2015,26(6):1356-1372.(MENG X W, LIU S D, ZHANG Y J, et al. Research on social recommender systems [J]. Journal of Software, 2015, 26(6): 1356-1372.)
[5] WANG G, XIE S, LIU B, et al. Review graph based online store review spammer detection [C]// ICDM 2011: Proceedings of the 2011 International Conference on Data Mining. Washington, DC: IEEE Computer Society, 2011: 1242-1247.
[6] SONG J, LEE S, KIM J. Spam filtering in twitter using sender-receiver relationship [C]// RAID '11: Proceedings of the 2011 14th International Conference on Recent Advances in Intrusion Detection. Berlin: Springer, 2011: 301-317.
[7] CHIRITA P A, NEJDL W, ZAMFIR C. Preventing shilling attacks in online recommender systems [C]// WIDM '05: Proceedings of the 2005 7th Annual ACM International Workshop on Web Information and Data Management. New York: ACM, 2005: 67-74.
[8] BILGE A, ÖZDEMIR Z, POLAT H. A novel shilling attack detection method [J]. Procedia Computer Science, 2014, 31: 165-174.
[9] CAO J, WU Z, MAO B, et al. Shilling attack detection utilizing semi-supervised learning method for collaborative recommender system [J]. World Wide Web, 2013, 16(5/6): 729-748.
[10] 刘江冬,梁刚,杨进.基于时效性的冷启动解决算法[J].现代计算机,2016(2):3-6. (LIU J D, LIANG G, YANG J. Timeliness-based algorithm for cold start [J]. Modern Computer, 2016(2): 3-6.)
[11] KOREN Y, BELL R, VOLINSKY C. Matrix factorization tech-niques for recommender systems [J]. Computer, 2009, 42(8): 30-37.

[1]	包玄, 陈红梅, 肖清. 融入时间的兴趣点协同推荐算法[J]. 计算机应用, 2021, 41(8): 2406-2411.
[2]	刘欢, 李晓戈, 胡立坤, 胡飞雄, 王鹏华. 基于知识图谱驱动的图神经网络推荐模型[J]. 计算机应用, 2021, 41(7): 1865-1870.
[3]	王治和, 常筱卿, 杜辉. 基于万有引力的自适应近邻传播聚类算法[J]. 计算机应用, 2021, 41(5): 1337-1342.
[4]	林怿星, 唐华. 基于异构信息网络的混合推荐模型[J]. 计算机应用, 2021, 41(5): 1348-1355.
[5]	高铭蔚, 桑楠, 杨茂林. 基于胶囊网络的交互式网络电视视频点播推荐模型[J]. 《计算机应用》唯一官方网站, 2021, 41(11): 3171-3177.
[6]	任柯舟, 彭甫镕, 郭鑫, 王喆, 张晓静. 动态融合社交信息的社会化推荐[J]. 计算机应用, 2021, 41(10): 2806-2812.
[7]	李翔锟, 贾彩燕. 融合重叠社区正则化及隐式反馈的协同过滤方法[J]. 计算机应用, 2021, 41(1): 53-59.
[8]	李春英, 汤庸, 肖政宏, 李天送. 学术社交网络中的权威学者推荐模型[J]. 计算机应用, 2020, 40(9): 2594-2599.
[9]	袁园, 吴文, 万毅. 基于熵驱动域适应学习的单幅图像阴影检测方法[J]. 计算机应用, 2020, 40(7): 2131-2136.
[10]	田保军, 刘爽, 房建东. 融合主题信息和卷积神经网络的混合推荐算法[J]. 计算机应用, 2020, 40(7): 1901-1907.
[11]	陈程军, 毛莺池, 王绎超. 基于激活-熵的分层迭代剪枝策略的CNN模型压缩[J]. 计算机应用, 2020, 40(5): 1260-1265.
[12]	葛宇, 梁静. 基于相遇概率时效性和重复扩散感知的机会网络消息转发算法[J]. 计算机应用, 2020, 40(5): 1397-1402.
[13]	张伍, 陈红梅. 基于多核模糊粗糙集与蝗虫优化算法的高光谱波段选择[J]. 计算机应用, 2020, 40(5): 1425-1430.
[14]	陈曦, 梅广, 张金金, 许维胜. 融合知识图谱和协同过滤的学生成绩预测方法[J]. 计算机应用, 2020, 40(2): 595-601.
[15]	秦婧, 张青博, 王斌. 关注长尾物品的推荐方法[J]. 计算机应用, 2020, 40(2): 454-458.

基于信息熵和时效性的协同过滤推荐

Collaborative filtering recommendation based on entropy and timeliness

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics