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.