Rating Prediction by Correcting User Rating Bias

Masanao Ochi, Y. Matsuo, Makoto Okabe, R. Onai
{"title":"Rating Prediction by Correcting User Rating Bias","authors":"Masanao Ochi, Y. Matsuo, Makoto Okabe, R. Onai","doi":"10.1109/WI-IAT.2012.186","DOIUrl":null,"url":null,"abstract":"We propose a novel method to improve the prediction accuracy on the rating prediction task by correcting the bias of user ratings. We demonstrate that the manner of user rating and review is biased and that it is necessary to correct this difference for more accurate prediction. Our proposed method comprises approaches based on the detection of each user value to ratings: The bias of the rating is detected using entropy of user rating and by updating word weights only when the words appear in the review, the problem of bias is reduced. We implement this idea by extending the Prank algorithm. We apply a review -- item matrix as a feature matrix instead of a user -- item matrix because of its volume of information. Our quantitative evaluation shows that our method improves the prediction accuracy (the Rank Loss measurement) significantly by 8.70 % compared with the normal Prank algorithm. Our proposed method helps users find out what they care about when buying something, and is applicable to newer variants of the Prank algorithm. Moreover, it is useful to most review sites because we use only rating and review data.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI-IAT.2012.186","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We propose a novel method to improve the prediction accuracy on the rating prediction task by correcting the bias of user ratings. We demonstrate that the manner of user rating and review is biased and that it is necessary to correct this difference for more accurate prediction. Our proposed method comprises approaches based on the detection of each user value to ratings: The bias of the rating is detected using entropy of user rating and by updating word weights only when the words appear in the review, the problem of bias is reduced. We implement this idea by extending the Prank algorithm. We apply a review -- item matrix as a feature matrix instead of a user -- item matrix because of its volume of information. Our quantitative evaluation shows that our method improves the prediction accuracy (the Rank Loss measurement) significantly by 8.70 % compared with the normal Prank algorithm. Our proposed method helps users find out what they care about when buying something, and is applicable to newer variants of the Prank algorithm. Moreover, it is useful to most review sites because we use only rating and review data.
通过修正用户评分偏差进行评分预测
提出了一种通过修正用户评分偏差来提高评分预测任务预测精度的新方法。我们证明了用户评分和评论的方式是有偏见的,为了更准确的预测,纠正这种差异是必要的。我们提出的方法包括基于检测每个用户对评级的值的方法:使用用户评级的熵来检测评级的偏差,并且通过仅在评论中出现单词时更新单词权重来减少偏差问题。我们通过扩展恶作剧算法来实现这个想法。我们应用评论-物品矩阵作为特征矩阵,而不是用户-物品矩阵,因为它的信息量很大。我们的定量评估表明,与普通的恶作剧算法相比,我们的方法显著提高了预测精度(Rank Loss测量)8.70%。我们提出的方法可以帮助用户在购买东西时找到他们关心的东西,并且适用于恶作剧算法的新变体。此外,它对大多数评论网站都很有用,因为我们只使用评级和评论数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信