期刊文献+

基于多维信任和联合矩阵分解的社会化推荐方法 被引量:2

Social recommendation method based on multi-dimensional trust and collective matrix factorization
下载PDF
导出
摘要 针对现有社会化推荐算法在信任分析方面的不足,研究了从社交辅助信息中充分挖掘用户信任关系的方法,进而提出一种基于多维信任计算和联合矩阵分解的社会化推荐算法。首先,从用户社交行为、社交圈特征获得用户的动态和静态两种局部信任度,再利用信任网络的结构特征提取全局信任度;然后,构造一种对增强关注矩阵和社交信任矩阵进行联合矩阵分解的社会化推荐算法,并采用随机梯度下降法对其求解。基于新浪微博数据集的实验结果表明,所提出的算法在推荐精度和Top-K推荐能力方面明显优于socailMF、 LOCABAL、 contextMF和TBSVD这几种代表性的社会化推荐算法。 Aiming at the shortages in trust analysis of existing social recommendation algorithms, a social recommendation algorithm based on multi-dimensional trust and collective matrix factorization was proposed with full use of user trust relationship mined from social auxiliary information. Firstly, the dynamic and static local trust relationships were extracted respectively from social interaction behaviors and social circle features of the user, and the global trust relationship was extracted from the structural features of trust network. Then, a social recommendation algorithm was presented by collective factorizing the enhanced following relationship matrix and the social trust relationship matrix, and a stochastic gradient descent method was utilized to solve the algorithm. The experimental results on the Sina microblog dataset indicate that the proposed algorithm outperforms some popular social recommendation algorithms such as socialMF, LOCABAL, contextMF and TBSVD(Trust Based Singular Value Decomposition), in terms of recommendation accuracy and Top-K performance.
作者 王磊 任航 龚凯 WANG Lei;REN Hang;GONG Kai(School of Economic Information Engineering, Southwest University of Finance and Economics, Chengdu Sichuan 610074, China)
出处 《计算机应用》 CSCD 北大核心 2019年第5期1269-1274,共6页 journal of Computer Applications
基金 教育部人文社会科学研究规划基金资助项目(16XJAZH002)~~
关键词 推荐算法 信任关系 社交网络 交互行为 联合矩阵分解 recommendation algorithm trust relationship social network interaction collective matrix factorization
  • 相关文献

参考文献5

二级参考文献29

  • 1Ma H, King I, Lyu M. Learning to recommend with social trust ensemble[CJ //Proc of the 32nd ACM Int Conf on Research and Development in Information Retrieval. New York: ACM, 2009: 203-210.
  • 2Ma H, Yang H, Lyu M, et al. Sorce. Social recommendation using probabilistic matrix factorization[CJ I/Proc of the 17th ACM Conf on Information and Knowledge Management. New York: ACM, 2008: 931-940.
  • 3Yeung A C, Iwata T. Strength of social influence in trust networks in product review sites[C] I/Proc of the 4th ACM Int Conf on Web Search and Data Mining. New York: ACM, 2011: 495-504.
  • 4Yang X, Steck H, Liu Y. Circle-based recommendation in online social networks[CJ I/Proc of the 18th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 2013: 1267-1275.
  • 5Jamali M, Ester M. A matrix factorization technique with trust propagation for recommendation in social networks[CJ I/Proc of the 4th ACM Conf on Recommender Systems. New York: ACM, 2010: 135-142.
  • 6lin R, ChaiJ, Si L. An automatic weighting scheme for collaborative filtering[C] //Proc of the 27th Annual Int ACM SIGIR Conf on Research and Development in Information Retrieval. New York: ACM, 2004: 337-344.
  • 7Xue G, Lin C, Yang Q, et al. Scalable collaborative filtering using cluster-based smoothing[CJ //Proc of the 28th Annual Int ACM SIGIR Conf on Research and Development in Information Retrieval. New York: ACM, 2005: 114-121.
  • 8Sarwar B, Karypis G, KonstanJ, et al. Item-based collaborative filtering recommendation algorithms[CJ IIProc of the 10th Int Conf on World Wide Web. New York: ACM, 2001: 285-295.
  • 9CannyJ. Collaborative filtering with privacy via factor analysis[CJ IIProc of the 25th Annual Int ACM SIGIR Conf on Research and Development in Information Retrieval. New York: ACM, 2002: 238-245.
  • 10Hofmann T. Collaborative filtering via gaussian probabilistic latent semantic analysis[CJ //Proc of the 26th Annual Int ACM SIGIR Conf on Research and Development in Informaion Retrieval. New York: ACM, 2003: 259-266.

共引文献149

同被引文献29

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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