首页> 外文期刊>Engineering Applications of Artificial Intelligence >Presentation a Trust Walker for rating prediction in recommender system with Biased Random Walk: Effects of H-index centrality, similarity in items and friends
【24h】

Presentation a Trust Walker for rating prediction in recommender system with Biased Random Walk: Effects of H-index centrality, similarity in items and friends

机译:介绍一个信任步行者,用于偏见随机步行的推荐系统中的评级预测:H-Index Centrality的影响,物品和朋友的相似性

获取原文
获取原文并翻译 | 示例
           

摘要

In recent years, the use of trust-based recommendation systems to predict the scores of items not rated by users has attracted many researchers' interest. Accordingly, they create a trusted network of users, move in the trust graph, and search for the desired rank among the users by creating a Trust Walker and Random walk algorithm. Meanwhile, we face some challenges such as calculating the level of trust between users, the movement of Trust Walker using Random walk (random route selection), not discovering the desired rank, and as a result, the algorithm failure. In the present study, in order to solve the mentioned challenges, a trust-based recommender system is presented that predicts the ranks of items that the target user has not rated. In the first stage, a trusted network is developed based on the three criteria. In the next step, we define a Trust Walker to calculate the level of trust between users, and we apply the Biased Random Walk (BRW) algorithm to move it; the proposed method recommends it to the target user in the case of finding the desired rank of the item, and if that item does not exist in the defined trust network, it uses association rules to recognize items that are dependent on the item being searched and recommends them to the target user. The evaluation of this research has been performed on three datasets, and the obtained results indicate higher efficiency and more accuracy of the proposed method.
机译:近年来,使用基于信任的推荐系统来预测用户不评分的商品吸引了许多研究人员的兴趣。因此,它们创建可信赖的用户网络,在信任图中移动,并通过创建信任步行者和随机步行算法来搜索用户之间的所需等级。同时,我们面临一些挑战,如计算用户之间的信任程度,使用随机步行(随机路线选择)的信任步行者的运动,而不是发现所需的等级,结果是算法故障。在本研究中,为了解决提到的挑战,提出了一种基于信任的推荐系统,其预测目标用户未额定的项目的级别。在第一阶段,基于三个标准开发了一个值得信赖的网络。在下一步中,我们定义了一个信任步行者来计算用户之间的信任程度,我们应用了偏置随机步行(BRW)算法来移动它;该方法在查找所需等级的情况下,该方法将其推荐给目标用户,如果该项目不存在于定义的信任网络中,则它使用关联规则识别依赖于被搜索的项目的项目和向目标用户推荐它们。对该研究的评估已经在三个数据集上进行,所获得的结果表明提出的方法的效率更高,更准确。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号