Detecting, Representing and Querying Collusion in Online Rating Systems
Preprint
Abstract
Online rating systems are subject to malicious behaviors mainly by posting unfair rating scores. Users may try to individually or collaboratively promote or demote a product. Collaborating unfair rating 'collusion' is more damaging than individual unfair rating. Although collusion detection in general has been widely studied, identifying collusion groups in online rating systems is less studied and needs more investigation. In this paper, we study impact of collusion in online rating systems and asses their susceptibility to collusion attacks. The proposed model uses a frequent itemset mining algorithm to detect candidate collusion groups. Then, several indicators are used for identifying collusion groups and for estimating how damaging such colluding groups might be. Also, we propose an algorithm for finding possible collusive subgroup inside larger groups which are not identified as collusive. The model has been implemented and we present results of experimental evaluation of our methodology.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Security of Online Reputation Systems: The evolution of attacks and defensesIEEE Signal Processing Magazine, 2012
- Crowdsourcing systems on the World-Wide WebCommunications of the ACM, 2011
- A Query Language for Analyzing Business Processes Execution2011
- The design of a reliable reputation systemElectronic Commerce Research, 2010
- Dishonest Behaviors in Online Rating Systems: Cyber Competition, Attack Models, and Attack GeneratorJournal of Computer Science and Technology, 2009
- Reputation in Online Auctions: The Market for TrustCalifornia Management Review, 2006
- Information filtering via Iterative RefinementEurophysics Letters, 2006
- Automatic query formulations in information retrievalJournal of the American Society for Information Science, 1983