【24h】

MINING TRUST VALUES FROM RECOMMENDATION ERRORS

机译:从建议错误中挖掘信任值

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

摘要

Increasing availability of information has furthered the need for recommender systems across a variety of domains. These systems are designed to tailor each user's information space to suit their particular information needs. Collaborative filtering is a successful and popular technique for producing recommendations based on similarities in users' tastes and opinions. Our work focusses on these similarities and the fact that current techniques for defining which users contribute to recommendation are in need of improvement. In this paper we propose the use of trustworthiness as an improvement to this situation. In particular, we define and empirically test a technique for eliciting trust values for each producer of a recommendation based on that user's history of contributions to recommendations. We compute a recommendation range to present to a target user. This is done by leveraging under/overestimate errors in users' past contributions in the recommendation process. We present three different models to compute this range. Our evaluation shows how this trust-based technique can be easily incorporated into a standard collaborative filtering algorithm and we define a fair comparison in which our technique outperforms a benchmark algorithm in predictive accuracy. We aim to show that the presentation of absolute rating predictions to users is more likely to reduce user trust in the recommendation system than presentation of a range of rating predictions. To evaluate the trust benefits resulting from the transparency of our recommendation range techniques, we carry out user-satisfaction trials on BoozerChoozer, a pub recommendation system. Our user-satisfaction results show that the recommendation range techniques perform up to twice as well as the benchmark.
机译:信息可用性的提高进一步推动了跨多个领域对推荐系统的需求。这些系统旨在调整每个用户的信息空间,以适应他们的特定信息需求。协作过滤是一种成功且流行的技术,用于根据用户的口味和观点的相似性来生成推荐。我们的工作着眼于这些相似之处,以及一个事实,即用于定义哪些用户有助于推荐的当前技术需要改进。在本文中,我们建议使用信任度来改善这种情况。特别是,我们定义并凭经验测试了一种基于该用户对推荐的贡献历史来为该推荐的每个生产者得出信任值的技术。我们计算推荐范围以呈现给目标用户。这是通过在推荐过程中利用用户过去贡献中的低估/高估错误来实现的。我们提出了三种不同的模型来计算该范围。我们的评估表明如何将这种基于信任的技术轻松地整合到标准协作过滤算法中,并且我们定义了一个公平的比较,在这种比较中,我们的技术在预测准确性方面优于基准算法。我们旨在表明,与向用户提供绝对评分预测相比,向一系列推荐评分呈现方式更可能降低用户对推荐系统的信任度。为了评估推荐范围技术的透明性所带来的信任收益,我们在BoozerChoozer(一个酒吧推荐系统)上进行了用户满意度试验。我们的用户满意度结果表明,推荐范围技术的性能是基准的两倍。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号