{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T07:02:11Z","timestamp":1719730931935},"reference-count":3,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p> 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. <\/jats:p><jats:p> 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. <\/jats:p><jats:p> 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. <\/jats:p><jats:p> 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. <\/jats:p>","DOI":"10.1142\/s0218213006003053","type":"journal-article","created":{"date-parts":[[2006,12,15]],"date-time":"2006-12-15T06:50:55Z","timestamp":1166165455000},"page":"945-962","source":"Crossref","is-referenced-by-count":26,"title":["MINING TRUST VALUES FROM RECOMMENDATION ERRORS"],"prefix":"10.1142","volume":"15","author":[{"given":"JOHN","family":"O'DONOVAN","sequence":"first","affiliation":[{"name":"Adaptive Information Cluster, School of Computer Science and Informatics, University College Dublin, Ireland"}]},{"given":"BARRY","family":"SMYTH","sequence":"additional","affiliation":[{"name":"Adaptive Information Cluster, School of Computer Science and Informatics, University College Dublin, Ireland"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/64.608186"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245126"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1145\/345124.345161"}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213006003053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:55:15Z","timestamp":1565182515000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213006003053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":3,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S0218213006003053"],"URL":"https:\/\/doi.org\/10.1142\/s0218213006003053","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}