期刊文献+

社交关系在基于模型社会化推荐系统中的影响 被引量:6

Impact of Social Relationship on Model-Based Social Recommender Systems
下载PDF
导出
摘要 目前社会化推荐系统方面的研究主要集中于构建性能更优的基于模型的推荐算法,然而模型算法中分解得到的隐式特征和社交信息的变化会给推荐性能带来不确定性。为了消除不确定性,探究了在基于模型的社会化推荐系统中社交关系的变化对推荐性能的影响。实验首先按比例移除关系网络中的连边或节点,再对推荐质量进行评估,结果表明,社交关系的数量增多将对推荐质量带来明显提升,同时关系网络中心节点对推荐质量的影响巨大。因此,在构建基于模型的社会化推荐系统的过程中应尽可能多地获取社交关系,并提升中心节点的关系在推荐中的权重,降低非中心节点(潜在噪声)的影响。 At present, the research of social recommender systems mainly focuses on the construction of models based recommendation algorithms. However, the latent factors and the social information involved in the algorithms may bring uncertainty to the recommendation quality. To explore this uncertainty, this paper explores the impact of the social relation in the model-based social recommender systems. The experiments remove edges or nodes in the relation network proportionally, and then evaluate the recommendations. The results show that, with the increase of the relation density, the performance of the recommendation algorithms is boosted, and the central nodes make huge difference. Hence the social relation information should be collected much more during building the model-based social recommender systems. Moreover, processing data according to the importance of the nodes in the recommendation can help to enhance the recommendation performance and reduce the impact of noncentral nodes.
出处 《计算机科学与探索》 CSCD 北大核心 2018年第1期82-91,共10页 Journal of Frontiers of Computer Science and Technology
基金 国家自然科学基金No.61502062 重庆市基础与前沿研究计划项目No.cstc2015jcyj A40049 中央高校基础研究基金No.106112014CDJZR095502~~
关键词 社会化推荐系统 社交关系 协同过滤 中心节点 social recommender system social relation collaborative filter central nodes
  • 相关文献

参考文献3

二级参考文献117

  • 1Watts D, Strogatz S. Collective dynamics of small world networks[J]. Nature, 1998, 393: 440-442.
  • 2Barabdsi A, Bonabeau E. Scientific American, 2003, Scale free networks [J] 288: 60-69.
  • 3Callaway D, Newman J, Strogatz S, Watts D. Net- work robustness and fragility: percolation on random graphs[J]. Physical Review Letters, 2000, 85 (25) : 5468-5471.
  • 4Xia Y, Fan J. Efficient attack strategy to communica- tion networks with partial degree information[C]// Proceedings of 2011 IEEE International Symposium of Circuits and Systems. Rio de Janeiro, Brazil: IEEE Press, 2011: 1588-1591.
  • 5Freeman L C. A set of measures of centrality based upon betweenness[J]. Sociometry, 1977, 40(1): 35-41.
  • 6Wagner C, Roessner J, Bobb K, et al. Approaches to understanding and measuring interdisciplinary sci- entific research (IDR) : A review of the literature[J]. Journal of Informatics, 2011, 5(1) : 14-26.
  • 7Opsahl, T, Agneessens, F, Skvoretz, J . Node cen- trality in weighted networks: Generalizing degree and shortest paths[J]. Social Networks, 2010, 32: 245- 251.
  • 8Lerman K, Ghosh R, Kang J, Centrality Metric for Dynamic Networks [C]//Proceedings of KDD work- shop on Mining and Learning with Graphs (MLG). Washington D C, USA: ACM Press, 2010: 70-77.
  • 9Kim H, Tang J, Aderson R, et al. Centrality predic- tion in dynamic human contact networks[J]. Comput- er Networks, 2012, 56(3): 983-996.
  • 10Okamoto K, Chen W, Li X. Ranking of closeness centrality for large-scale social networks [J] Lecture Notes in Computer Science, 2008, 5059: 186-195.

共引文献220

同被引文献52

引证文献6

二级引证文献32

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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