Volume 94, Number 4, May 2011
|Number of page(s)||6|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||05 May 2011|
A robust ranking algorithm to spamming
Département de Physique, Université of Fribourg - CH-1700 Fribourg, Switzerland
2 Web Sciences Center, University of Electronic Science and Technology of China - 610054 Chengdu, PRC
Accepted: 6 April 2011
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.
PACS: 89.20.Ff – Computer science and technology / 89.65.-s – Social and economic systems / 89.20.Hh – World Wide Web, Internet
© EPLA, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.