Name
Abstract | ||
|---|---|---|
How to design an accurate and robust ranking algorithm is a fundamental problem with wide applications in many real systems. It is especially significant in online rating systems due to the existence of some spammers. In the literature, many well-performed iterative ranking methods have been proposed. These methods can effectively recognize the unreliable users and reduce their weight in judging the quality of objects, and finally lead to a more accurate evaluation of the online products. In this paper, we design an iterative ranking method with high performance in both accuracy and robustness. More specifically, a reputation redistribution process is introduced to enhance the influence of highly reputed users and two penalty factors enable the algorithm resistance to malicious behaviors. Validation of our method is performed in both artificial and real user-object bipartite networks. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1371/journal.pone.0097146 | PLOS ONE |
Field | DocType | Volume |
Data science,Computer science,Scientific production,Bipartite graph,Popularity,Citation,Filter (signal processing),Econophysics,Bioinformatics,Reputation | Journal | 9 |
Issue | ISSN | Citations |
5 | 1932-6203 | 3 |
PageRank | References | Authors |
0.40 | 13 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hao Liao | 1 | 51 | 5.37 |
| Rui Xiao | 2 | 81 | 10.87 |
| Giulio Cimini | 3 | 126 | 13.77 |
| Matus Medo | 4 | 263 | 21.28 |