首页> 外文期刊>Engineering Applications of Artificial Intelligence >Social personalized ranking with both the explicit and implicit influence of user trust and of item ratings
【24h】

Social personalized ranking with both the explicit and implicit influence of user trust and of item ratings

机译:社交个性化排名,具有用户信任和项目评分的显性和隐性影响

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

摘要

Due to the inherent deficiency of social collaborative filtering algorithms based on rating prediction, social personalized ranking algorithms based on ranking prediction have recently received much more attention in recommendation communities due to their close relationship with real industry problem settings. However, most existing social personalized ranking algorithms focus on either explicit feedback data or implicit feedback data rather than making full use of the information in the dataset. Until now, no studies have been done on social personalized ranking algorithms by exploiting both the explicit and implicit influence of user trust and of item ratings. In order to overcome the defects of prior researches and to further solve the problems of data sparsity and cold start of collaborative filtering, a new social personalized ranking model (SPR.SVD++) based on the newest xCLiMF model and TrustSVD model was proposed, which exploited both the explicit and implicit influence of user trust and of item ratings simultaneously and optimized the well-known evaluation metric Expected Reciprocal Rank (ERR) Experimental results on practical datasets showed that our proposed model outperformed existing state-of-the-art collaborative filtering approaches over two different evaluation metrics NDCG and ERR, and that the running time of SPR_SVD++ showed a linear correlation with the number of users in the data collection and the number of observations in the rating and trust matrices. Due to its high precision and good expansibility, SPR.SVD++ is suitable for processing big data and has wide application prospects in the field of internet information recommendation.
机译:由于基于评分预测的社交协作过滤算法的固有缺陷,基于排名预测的社交个性化排名算法由于与实际行业问题的紧密联系而在推荐社区中受到了越来越多的关注。但是,大多数现有的社交个性化排名算法都专注于显式反馈数据或隐式反馈数据,而不是充分利用数据集中的信息。到目前为止,还没有通过利用用户信任度和项目等级的显性和隐性影响对社交个性化排名算法进行任何研究。为了克服现有研究的不足,进一步解决数据稀疏和协同过滤的冷启动问题,提出了一种基于最新的xCLiMF模型和TrustSVD模型的社会化个性化排序模型(SPR.SVD ++),用户信任的显式和隐式影响以及项目评分,同时优化了众所周知的评估指标预期倒数排名(ERR)在实际数据集上的实验结果表明,我们提出的模型优于现有的最新协作过滤方法在两个不同的评估指标NDCG和ERR上,并且SPR_SVD ++的运行时间与数据收集中的用户数量以及等级和信任矩阵中的观察值数量呈线性相关。 SPR.SVD ++由于具有较高的精度和良好的扩展性,因此适合于处理大数据,在互联网信息推荐领域具有广阔的应用前景。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号