Group-based ranking method for online rating systems with spamming attacks
arXiv:1501.00677 · doi:10.1209/0295-5075/110/28003
Abstract
Ranking problem has attracted much attention in real systems. How to design a robust ranking method is especially significant for online rating systems under the threat of spamming attacks. By building reputation systems for users, many well-performed ranking methods have been applied to address this issue. In this Letter, we propose a group-based ranking method that evaluates users' reputations based on their grouping behaviors. More specifically, users are assigned with high reputation scores if they always fall into large rating groups. Results on three real data sets indicate that the present method is more accurate and robust than correlation-based method in the presence of spamming attacks.
6 pages, 5 figures, 2 tables
References in corpus (8)
- Link Prediction in Complex Networks: A Survey
- How to project a bipartite network?
- Recommender Systems
- Information filtering via Iterative Refinement
- Removing spurious interactions in complex networks
- Extracting the information backbone in online system
- Ranking users, papers and authors in online scientific communities
- Information filtering via hybridization of similarity preferential diffusion processes
Cited by in corpus (9)
- Vital nodes identification in complex networks
- Quantifying China's Regional Economic Complexity
- Computational Socioeconomics
- Evaluating user reputation in online rating systems via an iterative group-based ranking method
- A vertex similarity index for better personalized recommendation
- A trust-based recommendation method using network diffusion processes
- Accumulative time-based ranking method to reputation evaluation in information networks
- The Strength of Structural Diversity in Online Social Networks
- Improving the performance of reputation evaluating by combining the structure of network and nonlinear recovery