Faculté des sciences

## A robust ranking algorithm to spamming

### In: EPL - Europhysics Letters, 2011, vol. 94, no. 4, p. 48002

Ranking problem of web-based rating systems has attracted much attention. 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, the reputation of a user is iteratively determined by the correlation coefficient... Plus

Ajouter à la liste personnelle

# Exporter vers

Summary
Ranking problem of web-based rating systems has attracted much attention. 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, the reputation of a 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.