首页> 外文期刊>PLoS One >Recommendation system in social networks with topical attention and probabilistic matrix factorization
【24h】

Recommendation system in social networks with topical attention and probabilistic matrix factorization

机译:具有局部关注和概率矩阵分解的社交网络推荐系统

获取原文
           

摘要

Collaborative filtering (CF) is a common recommendation mechanism that relies on user-item ratings. However, the intrinsic sparsity of user-item rating data can be problematic in many domains and settings, limiting the ability to generate accurate predictions and effective recommendations. At present, most algorithms use two-valued trust relationship of social network to improve recommendation quality but fail to take into account the difference of trust intensity of each friend and user’s comment information. To this end, the recommendation system within a social network adopts topical attention and probabilistic matrix factorization (STAPMF) is proposed. We combine the trust information in social networks and the topical information from review documents by proposing a novel algorithm combining probabilistic matrix factorization and attention-based recurrent neural networks to extract item underlying feature vectors, user’s personal potential feature vectors, and user’s social hidden feature vectors, which represent the features extracted from the user’s trusted network. Using real-world datasets, we show a significant improvement in recommendation performance comparing with the prevailing state-of-the-art algorithms for social network-based recommendation.
机译:协作过滤(CF)是一种依赖于用户项目评级的共同推荐机制。然而,在许多域和设置中,用户项目评级数据的内在稀疏性可能是有问题的,限制了生成准确预测和有效建议的能力。目前,大多数算法使用社交网络的双价信任关系来提高推荐质量,但未能考虑每个朋友和用户评论信息的信任强度的差异。为此,建议在社交网络内采用局部注意力和概率矩阵分解(Stapmf)。我们将信任信息与审查文档中的局部信息组合提出结合概率矩阵分解和基于关注的经常性神经网络来提取项目基础特征向量,用户的个人潜在特征向量和用户的社会隐藏特征向量的新算法,它表示从用户可信网络中提取的功能。使用现实世界数据集,我们展示了与基于社交网络的普遍算法的推荐算法进行了重大改进。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号