Cargando…

Ranking Reputation and Quality in Online Rating Systems

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 propose...

Descripción completa

Detalles Bibliográficos
Autores principales: Liao, Hao, Zeng, An, Xiao, Rui, Ren, Zhuo-Ming, Chen, Duan-Bing, Zhang, Yi-Cheng
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2014
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4018342/
https://www.ncbi.nlm.nih.gov/pubmed/24819119
http://dx.doi.org/10.1371/journal.pone.0097146
Descripción
Sumario: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.