期刊文献+

基于热扩散影响力传播的社交网络个性化推荐算法 被引量:6

Heat Diffusion Influence Propagation Based Personalized Recommendation Algorithm for Social Network
下载PDF
导出
摘要 有针对性地为用户提供推荐,提高互联网信息利用率是个性化推荐系统的主要目标.文中基于热扩散传播概率模型,结合用户在社交网络中隐含的跟随关系,提出基于热扩散影响力传播的社交网络个性化推荐算法.首先,算法将现实生活中人与人的朋友关系转化为购物网络中用户与用户的跟随关系,构建异构信息网络图,计算用户之间的复合相似度.然后,利用基于热扩散概率模型模拟社会网络中影响力的传播过程,计算社交网络中用户的跟随概率分数并精确排序,筛选与目标用户相似的邻近用户.最后,根据目标邻近用户对各个产品的评分,将评分较高、具有潜在兴趣的产品推荐给目标用户,实现个性化的用户推荐.在公开数据集上与现有的个性化推荐算法进行对比,实验表明,文中算法具有较好的精确度和多样化的推荐效果. The primary objective of a personalized recommendation system is to provide pertinent recommendations for users and improve internet information utilization.A social network personalized recommendation algorithm based on heat diffusion influence propagation(HDIP)is proposed in this paper combining HDIP with the hidden follow-up relationship in the social network of users.Firstly,in the HDIP algorithm,the friendship in real life is transformed into follow-up relationship between customers in shopping network.Heterogeneous information network graphs are constructed and the composite similarities between users are calculated.Secondly,the influence propagation process in social networks based on the heat diffusion model is simulated.Probability scores of users in the social network are calculated and accurately sorted to select neighboring users similar to the target users.Finally,the products of potential interest are recommended to the target users according to the ranking.Thus,the personalized recommendation is implemented.The public dataset is utilized for the comparison between HDIP and conventional recommendation algorithms.The experimental results show that HDIP produces a relatively high accuracy and various recommendation effects.
作者 任永功 杨柳 刘洋 REN Yonggong;YANG Liu;LIU Yang(School of Computer and Information Technology,Liaoning Normal University,Dalian 116081)
出处 《模式识别与人工智能》 EI CSCD 北大核心 2019年第8期746-757,共12页 Pattern Recognition and Artificial Intelligence
基金 国家自然科学基金项目(No.61772252) 辽宁省自然科学基金项目(No.20180550542) 大连市科技创新基金项目(No.2018J12GX047) 大连市重点实验室专项基金项目资助~~
关键词 数据挖掘 社交网络 热扩散 协同过滤 个性化推荐 Data Mining Social Network Heat Diffusion Collaborative Filtering Personalized Recommendation
  • 相关文献

参考文献2

二级参考文献16

  • 1陈安龙,唐常杰,陶宏才,元昌安,谢方军.基于极大团和FP-Tree的挖掘关联规则的改进算法[J].软件学报,2004,15(8):1198-1207. 被引量:30
  • 2徐前方,肖波,郭军.一种基于相关度统计的告警关联规则挖掘算法[J].北京邮电大学学报,2007,30(1):66-70. 被引量:15
  • 3Chen J, Geyer W, Dugan C, Muller M, Guy I. Make new friends, but keep the old: Recommending people on social networking sites//Proceedings of the 27th International Conference on Human Factors in Computing Systems. New York, NY, USA, 2009 201-210.
  • 4Sarwar B M, Karypis G, Konstan J A, Riedl John. Analysis of recommendation algorithms for e-commerce//Proceedings of the 2nd ACM Conference on Electronic Commerce (EC-00). Minneapolis, MN, USA, 2000:158 167.
  • 5Linden Greg, Smith Brent, York Jeremy, Amazon. com recommendations: Item-to-item collaborative filtering. IEEE Internet Computing, 2003, 7(1): 76-80.
  • 6Pazzani M J, Billsus D. Content based recommendation systems//Brusilovsky P et al eds. The Adaptive Web. Springer Verlag, 2007:325 341.
  • 7Mislove Alan, Marcon Massimiliano, Gummadi Krishna P, Druschel Peter, Bhattacharjee Bobby. Measurement and analysis of online social networks//Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement. San Diego, CA, USA, 2007:29 /i2.
  • 8Piao Scott, Whittle Jon. A feasibility study on extracting twitter users' interests using NLP tools for serendipitous connections//Proceedings of the 3rd IEEE International Conference on Social Computing (SocialCom 2011). Boston, MA, 2011= 910 915.
  • 9Sakaguchi T, Akaho Y, Takagi T, Shintani T. Recommen dations in twitter using conceptual {uzzy sets//Proceedings of the 2010 Annual Meeting of the North American Fuzzy lnfor mation Processing Society (NAFIPS). Toronto, Canada, 2010:1 6.
  • 10Granovetter M. The strength of weak ties. American Journal of Sociology, 1973, 78(6).- 1360 1380.

共引文献139

同被引文献57

引证文献6

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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