A Prediction-Based Approach for Computing Robust Rating Scores

Mohammad Allahbakhsh, R. Rafat, Fariba Layegh Rafat
{"title":"A Prediction-Based Approach for Computing Robust Rating Scores","authors":"Mohammad Allahbakhsh, R. Rafat, Fariba Layegh Rafat","doi":"10.1109/ICCKE48569.2019.8964992","DOIUrl":null,"url":null,"abstract":"Assessing quality of products, especially when purchased online, is always a challenge. One of the widely used approaches for addressing this challenge is to rely on the scores computed by online rating systems, based on the feedback received from other users. For several reasons, like gaining benefits, personal interests or collusion, rating systems have always been facing with challenge of dishonest feedback. Although many techniques have been proposed for collusion detection, there are still issues that need more investigations. One of these issues is dealing with the sparsity problem, i.e., small number of votes per product, which makes it easier to manipulate scores. In this paper we propose a novel technique for calculating robust rank scores which relies on feedback prediction. In our model, we improve quality of computed scores by predicting feedback, for the people who have not assessed a product. This will result in decreasing sparsity. Then, we propose an iterative technique to calculate product rating scores based on the real and predicted feedbacks. We have implemented our method and compared its performance with three well-known related works. The result of comparison shows the superiority of our model.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"96 1","pages":"116-121"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE48569.2019.8964992","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Assessing quality of products, especially when purchased online, is always a challenge. One of the widely used approaches for addressing this challenge is to rely on the scores computed by online rating systems, based on the feedback received from other users. For several reasons, like gaining benefits, personal interests or collusion, rating systems have always been facing with challenge of dishonest feedback. Although many techniques have been proposed for collusion detection, there are still issues that need more investigations. One of these issues is dealing with the sparsity problem, i.e., small number of votes per product, which makes it easier to manipulate scores. In this paper we propose a novel technique for calculating robust rank scores which relies on feedback prediction. In our model, we improve quality of computed scores by predicting feedback, for the people who have not assessed a product. This will result in decreasing sparsity. Then, we propose an iterative technique to calculate product rating scores based on the real and predicted feedbacks. We have implemented our method and compared its performance with three well-known related works. The result of comparison shows the superiority of our model.
一种基于预测的鲁棒评分计算方法
评估产品的质量,尤其是在网上购买的产品,一直是一个挑战。解决这一挑战的一种广泛使用的方法是依靠在线评分系统根据其他用户的反馈计算出的分数。由于获取利益、个人利益或共谋等原因,评级系统一直面临着不诚实反馈的挑战。虽然已经提出了许多合谋检测技术,但仍有一些问题需要进一步研究。其中一个问题是处理稀疏性问题,即每个产品的投票数量较少,这使得操纵分数变得更容易。本文提出了一种基于反馈预测的鲁棒等级分数计算方法。在我们的模型中,我们通过预测没有评估产品的人的反馈来提高计算分数的质量。这将导致稀疏性的降低。然后,我们提出了一种基于真实反馈和预测反馈计算产品评级分数的迭代技术。我们已经实现了我们的方法,并将其性能与三个知名的相关作品进行了比较。对比结果表明了模型的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信