{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T11:48:03Z","timestamp":1774352883160,"version":"3.50.1"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T00:00:00Z","timestamp":1585440000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Manage. Inf. Syst."],"published-print":{"date-parts":[[2020,3,31]]},"abstract":"<jats:p>With the increasing popularity of online shopping markets, a significant number of consumers rely on these venues to meet their demands while choosing different products based on the ratings provided by others. Simultaneously, consumers feel confident in expressing their opinions through ratings. As a result, millions of ratings are generated on the web for different products, services, and dealers. Nonetheless, a noticeable number of users post unfair feedback. Recent studies have shown that reputation escalation is emerging as a new service, by which dealers pay to receive good feedback and escalate their ratings in online shopping markets. Therefore, finding robust and reliable ways to distinguish between fake and trustworthy ratings from users is a crucial task for every online shopping market. Moreover, with the dramatic increase in the number of ratings provided by consumers, scalability has arisen as another significant issue in the existing methods of reputation systems. To tackle these issues, we propose a randomized algorithm that calculates the reputation based on a random sample of the ratings. Since the randomly selected sample has a logarithmic size, it guarantees feasible scalability for large-scale online review systems. In addition, the randomness nature of the algorithm makes it robust against unfair ratings. We provide a thorough theoretical analysis of the proposed algorithm and validate its effectiveness through extensive empirical evaluation using real-world and synthetically generated datasets. Our experimental results show that the proposed method provides a high accuracy while running much faster than the existing iterative filtering approaches.<\/jats:p>","DOI":"10.1145\/3384472","type":"journal-article","created":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T09:39:27Z","timestamp":1585474767000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["A Randomized Reputation System in the Presence of Unfair Ratings"],"prefix":"10.1145","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1172-1941","authenticated-orcid":false,"given":"Mohsen","family":"Rezvani","sequence":"first","affiliation":[{"name":"Shahrood University of Technology, Shahrood, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mojtaba","family":"Rezvani","sequence":"additional","affiliation":[{"name":"Australian National University, Canberra, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,3,29]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 7th International AAAI Conference on Weblogs and Social Media.","author":"Akoglu Leman","year":"2013"},{"key":"e_1_2_1_2_1","volume-title":"Internet Predictions. Retrieved","author":"Burke Jeffrey A.","year":"2020"},{"key":"e_1_2_1_3_1","volume-title":"Identifying online user reputation in terms of user preference. Physica A: Statistical Mechanics and its Applications 494","author":"Dai Lu","year":"2018"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/090748196"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.learninstruc.2013.07.001"},{"key":"e_1_2_1_6_1","article-title":"Reputation measurement for online services based on dominance relationships","author":"Fu Xiaodong","year":"2018","journal-title":"IEEE Transactions on Services Computing. Epub ahead of print."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2012.715641"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2017.01.055"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592451.1592452"},{"key":"e_1_2_1_12_1","first-page":"1","article-title":"On concentration of probability","volume":"10","author":"Janson Svante","year":"2002","journal-title":"Contemporary Combinatorics"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775242"},{"key":"e_1_2_1_14_1","unstructured":"Srijan Kumar Bryan Hooi Disha Makhija Mohit Kumar Christos Faloutsos and V. S. Subrahmanian. 2017. FairJudge: Trustworthy user prediction in rating platforms. arXiv:1703.10545.  Srijan Kumar Bryan Hooi Disha Makhija Mohit Kumar Christos Faloutsos and V. S. Subrahmanian. 2017. FairJudge: Trustworthy user prediction in rating platforms. arXiv:1703.10545."},{"key":"e_1_2_1_15_1","volume-title":"Meyer","author":"Langville Amy N.","year":"2012"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1209\/epl\/i2006-10204-8"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.53"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2007.84"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34624-8_46"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1858158.1858162"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2016.10.031"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the 2008 42nd Asilomar Conference on Signals, Systems, and Computers. IEEE","author":"Liu Y."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2668992"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/91\/48004"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963485"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.2307\/41166371"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10796-010-9275-8"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187864"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783370"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183323"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517351.2517394"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2015.9"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2014.2316816"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSNIP.2015.7106935"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 2013 IFIP\/IEEE International Symposium on Integrated Network Management (IM\u201913)","author":"Stelte Bj\u00f6rn","year":"2013"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/MSP.2011.942344","article-title":"Security of online reputation systems: The evolution of attacks and defenses","volume":"29","author":"Sun Yan","year":"2012","journal-title":"IEEE Signal Processing Magazine"},{"key":"e_1_2_1_37_1","volume-title":"Judgment under uncertainty: Heuristics and biases. Science 185, 4157","author":"Tversky Amos","year":"1974"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2014.6846739"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the 21st International Conference on World Wide Web (WWW\u201912)","author":"Wang Gang"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.124"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741650"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460877.1460888"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-009-9277-5"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/94\/48002"}],"container-title":["ACM Transactions on Management Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3384472","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3384472","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:12Z","timestamp":1750199592000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3384472"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,29]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3,31]]}},"alternative-id":["10.1145\/3384472"],"URL":"https:\/\/doi.org\/10.1145\/3384472","relation":{},"ISSN":["2158-656X","2158-6578"],"issn-type":[{"value":"2158-656X","type":"print"},{"value":"2158-6578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,29]]},"assertion":[{"value":"2018-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}