A robust ranking algorithm to spamming
arXiv:1012.3793 · doi:10.1209/0295-5075/94/48002
Abstract
Ranking problem of web-based rating system has attracted many attentions. A good ranking algorithm should be robust against spammer attack. Here we proposed a correlation based reputation algorithm to solve the ranking problem of such rating systems where user votes some objects with ratings. In this algorithm, reputation of user is iteratively determined by the correlation coefficient between his/her rating vector and the corresponding objects' weighted average rating vector. Comparing with iterative refinement (IR) and mean score algorithm, results for both artificial and real data indicate that, the present algorithm shows a higher robustness against spammer attack.
arXiv comment4 pages, 4 figures, 3 Tables
References in corpus (6)
- Emergence of scaling in random networks
- Diffusion of scientific credits and the ranking of scientists
- Empirical analysis of web-based user-object bipartite networks
- Information filtering via Iterative Refinement
- Decoding Information from noisy, redundant, and intentionally-distorted sources
- The effect of discrete vs. continuous-valued ratings on reputation and ranking systems
Cited by in corpus (12)
- Vital nodes identification in complex networks
- Recommender Systems
- Identifying Influential Spreaders by Weighted LeaderRank
- Ranking in evolving complex networks
- Quantifying China's Regional Economic Complexity
- Computational Socioeconomics
- Ranking users, papers and authors in online scientific communities
- Evaluating user reputation in online rating systems via an iterative group-based ranking method
- Rating through Voting: An Iterative Method for Robust Rating
- Measuring quality, reputation and trust in online communities
- Accumulative time-based ranking method to reputation evaluation in information networks
- Improving the performance of reputation evaluating by combining the structure of network and nonlinear recovery