期刊文献+

基于最大团的社交网络个性化推荐 被引量:1

Personalized Recommendation of Social Network Based on Maximum Clique
下载PDF
导出
摘要 传统的协同过滤算法理论上是基于社会理论的,因为它们与我们参考其他人的选择的过程类似。但比较严重的冷启动问题一直影响着协同过滤算法的实际效率。论文基于传统的协同过滤推荐算法,以用户社交网络中的最大团为单位进行团推荐,利用社会化网络中好友圈的兴趣汇聚及相互影响,通过团好友对物品的评分的平均数来作为作为团成员的推荐分。实验证明了协同过滤中使用最大团与相似的人混合推荐而不只是使用相似的人进行推荐,不仅可以提升推荐的准确率,而且对于传统推荐系统中比较严重的冷启动问题也得到了一定程度的缓解。 Traditional collaborative filtering algorithms are theoretically based on social theory because they are similar to the way we refer to other people's choices. However,the serious cold boot problem has always affected the practical efficiency of collab. orative filtering algorithm. The traditional collaborative filtering recommendation algorithm is based on the group recommended to the largest group of users in a social network as a unit,the interaction and convergence of interest friends in social network,the aver. age number of items in the group of friends as members of the score points recommended. The experiment proves that collaborative filtering using the maximum clique and people with similar mixed recommendation and not just the use of similar people recommend. ed not only can improve the accuracy of recommendation,but also to some extent alleviate the cold start problem is more serious in traditional recommendation system.
作者 陈小礼 汪洋 彭艳兵 CHEN Xiaoli;WANG Yang;PENG Yanbing(FiberHome Technology Software Co.,Ltd.,Nanjing 210019;FiberHome Technologies Group,Wuhan 430074)
出处 《计算机与数字工程》 2019年第3期631-637,共7页 Computer & Digital Engineering
关键词 社交网络 最大团 协同过滤 冷启动 social relationship network maximum clique collaborative filtering cold start
  • 相关文献

参考文献13

二级参考文献128

  • 1张润梅,王浩,姚宏亮,方宝富.影响图及其在Robocup中的应用[J].系统仿真学报,2005,17(1):134-137. 被引量:6
  • 2周本达,王浩,姚宏亮.1(1/2)片联合树算法在动态贝叶斯网精确推理中的应用[J].计算机工程与应用,2005,41(14):81-84. 被引量:3
  • 3沈云斐,沈国强,蒋丽华,覃征.基于时效性的Web页面个性化推荐模型的研究[J].计算机工程,2006,32(13):80-81. 被引量:6
  • 4Murphy K. Dynamic Bayesian networks: representation, inference and learning[D]. University of California, Berkeley, 2002
  • 5Jensen F V,Jensen F. Optimal junction trees[C]//Proc, of UAl94. 1994:360-366
  • 6Boyen X, Kollcn D. Tractable inference for complex stochastic processes[C]//Proc, of UAI-98. San Francisco: Morgan Kaufmann, 1998: 33-42
  • 7Dechter R. Bucket elimination: A unifying framework for probabilistic inference[C]//Proc, of UAI-96. San Francisco: Morgan Kaufmann, 1996 : 75-104
  • 8Draper D. Clustering without(thinking about) triangulation[C]//Proc, of UAI-95. San Francisco: Morgan Kaufmann, 1995: 125-133
  • 9Kjaerulff U. Reduction of computational complexity in Bayesian networks through removal of weak dependences[C]//Proc, of UAI-94. 1994 : 374-382
  • 10Paskin M A. Thin junction tree filters frontier for simultaneous localization and mapping[C]//Proc. of IJCAI-03. 2003:1157-1164

共引文献438

同被引文献11

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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