Mining trust values from recommendation errors

被引:19
|
作者
O'Donovan, John [1 ]
Smyth, Barry [1 ]
机构
[1] Univ Coll Dublin, Adapt Informat Cluster, Sch Comp Sci & Informat, Dublin 2, Ireland
关键词
recommender systems; collaborative filtering; profile similarity; trust;
D O I
10.1142/S0218213006003053
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:945 / 962
页数:18
相关论文
共 50 条
  • [11] From Post to Values: Mining Schwartz Values of Individuals from Social Media
    Sun, Mengshu
    Zhang, Huaping
    Zhao, Yanping
    Shang, Jianyun
    SOCIAL MEDIA PROCESSING, 2014, 489 : 206 - 219
  • [12] Trust Based Recommendation Systems
    Ozsoy, Makbule Gulcin
    Polat, Faruk
    2013 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), 2013, : 1267 - 1274
  • [13] Roundtable Gossip Algorithm: A Novel Sparse Trust Mining Method for Large-Scale Recommendation Systems
    Liu, Mengdi
    Xu, Guangquan
    Zhang, Jun
    Shankaran, Rajan
    Luo, Gang
    Zheng, Xi
    Zhan, Zonghua
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2018, PT IV, 2018, 11337 : 495 - 510
  • [14] Mining Trust Relationships from Online Social Networks
    Yu Zhang
    Tong Yu
    Journal of Computer Science and Technology, 2012, 27 : 492 - 505
  • [15] Mining Trust Relationships from Online Social Networks
    Zhang, Yu
    Yu, Tong
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2012, 27 (03) : 492 - 505
  • [16] Regulation and the Role of Trust: Reflections from the Mining Industry
    Gunningham, Neil
    Sinclair, Darren
    JOURNAL OF LAW AND SOCIETY, 2009, 36 (02) : 167 - 194
  • [17] Mining Trust Relationships from Online Social Networks
    张宇
    于彤
    JournalofComputerScience&Technology, 2012, 27 (03) : 492 - 505
  • [18] Mining Latent Features from Reviews and Ratings for Item Recommendation
    Zhai, Chenyu
    Peng, Jing
    2016 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE & COMPUTATIONAL INTELLIGENCE (CSCI), 2016, : 1119 - 1125
  • [19] CONTEXTUALIZED RECOMMENDATION BASED ON REALITY MINING FROM MOBILE SUBSCRIBERS
    Jung, Jason J.
    Lee, Hojin
    Choi, Kwang Sun
    CYBERNETICS AND SYSTEMS, 2009, 40 (02) : 160 - 175
  • [20] From science as "special" to understanding its errors and justifying trust
    Allchin, Douglas
    SCIENCE EDUCATION, 2020, 104 (03) : 605 - 613