pith. sign in

arxiv: 1012.3793 · v1 · pith:CB4TMWBOnew · submitted 2010-12-17 · 💻 cs.IR · physics.data-an

A robust ranking algorithm to spamming

classification 💻 cs.IR physics.data-an
keywords algorithmrankingratingattackcorrelationobjectsproblemreputation
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.