期刊文献+

基于扩散的推荐算法的可预测性 被引量:1

Predictability of diffusion-based recommendation algorithm
下载PDF
导出
摘要 推荐系统能够帮助解决信息过载问题,并可以根据用户的历史记录预测其兴趣进行推荐.推荐系统的核心是推荐算法,而提高最大推荐精度对进一步提升推荐算法精度至关重要.针对这一问题,提出了一个添加虚拟边的方法,通过增加推荐算法资源扩散的宽度使更多的商品可以获得资源,提高测试集内商品出现在推荐列表中的可能性,从而提高基于扩散的推荐算法的最大推荐精度.实验结果表明,本文方法提升了基于扩散的推荐算法的可预测性,同时也提升了推荐的准确性. Recommendation system can help solve the problem of information overload,and can predict the interests of users according to their historical records for recommendation.The core of the recommendation system is recommendation algorithm,improving the maximum recommendation accuracy is very important for further improving the accuracy of the recommendation algorithm.In order to solve this problem,a method of adding virtual edges was proposed in this paper.By increasing the width of resource diffusion,more products could obtain resources,and the possibility of products in test set appearing in recommendation list was improved,so as to improve the maximum recommendation accuracy of the diffusion-based recommendation algorithm.Experimental results show that this method improves the predictability of the diffusion-based recommendation algorithm and the accuracy of recommendation.
作者 王玫申 张鹏 薛乐洋 WANG Meishen;ZHANG Peng;XUE Leyang(School of Science,Beijing University of Posts and Telecommunications,Beijing 100876,China;International Academic Center of Complex Systems,Beijing Normal University,Zhuhai,Guangdong 519087,China)
出处 《中国科技论文在线精品论文》 2021年第4期462-467,共6页 Highlights of Sciencepaper Online
基金 国家重点研发计划(2020YFF0305300) 北京邮电大学提升科技创新能力行动计划(2019XD-A10)
关键词 应用数学 推荐系统 扩散算法 虚拟边 可预测性 applied mathematics recommendation system diffusion algorithms virtual edge predictability
  • 相关文献

参考文献4

二级参考文献87

  • 1GETOOR L,DIEHL C P.Link mining:a survey[J].ACM SIGKDD Explorations Newsletter,2005,7(2):3-12.
  • 2SARUKKAI R R.Link prediction and path analysis using markov chains[J].Computer Networks,2000,33(1-6):377-386.
  • 3ZHU J,HONG J,HUGHES J G Using markov chains for link prediction in adaptive web sites[J].Lect Notes Comput Sci,2002,2311:60-73.
  • 4POPESCUL A,UNGAR L.Statistical relational learning for link prediction[C] //Proceedings of the Workshop on Learning Statistical Models from Relational Data.New York:ACM Press,2003:81-87.
  • 5O'MADADHAIN J,HUTCHINS J,SMYTH P.Prediction and ranking algorithms for event-based network data[C] //Proceedings of the ACM SIGKDD 2005.New York:ACM Press,2005:23-30.
  • 6LIN D.An information-theoretic definition of similarity[C] //Proceedings of the 15th Intl Conf Mach.Learn..San Francisco,Morgan Kaufman Publishers,1998:296-304.
  • 7LIBEN-NOWELL D,KLEINBERG J.The link-prediction problem for social networks[J].J Am Soc Inform Sci Technol,2007,58(7):1019-1031.
  • 8CLAUSET A,MOORE C,NEWMAN M E J.Hierarchical structure and the prediction of missing links in networks[J].Nature,2008,453:98-101.
  • 9HOLLAND P W,LASKEY K B,LEINHARD S.Stochastic blockmodels:First steps[J].Social Networks,1983,5:109-137.
  • 10GUIMERA R,SALES-PARDO M.Missing and spurious interactions and the reconstruction of complex networks[J].Proc Natl Sci Acad USA,2009,106(52):22073-22078.

共引文献498

同被引文献14

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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