Liao Hao, Zeng An, Xiao Rui, Ren Zhuo-Ming, Chen Duan-Bing, Zhang Yi-Cheng
Department of Physics, University of Fribourg, Fribourg, Switzerland.
Department of Physics, University of Fribourg, Fribourg, Switzerland; Research Center of Complex Systems Science, University of Shanghai for Science and Technology, Shanghai, China.
PLoS One. 2014 May 12;9(5):e97146. doi: 10.1371/journal.pone.0097146. eCollection 2014.
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.
如何设计一种准确且稳健的排名算法是一个在许多实际系统中具有广泛应用的基本问题。由于存在一些垃圾信息发送者,它在在线评级系统中尤为重要。在文献中,已经提出了许多性能良好的迭代排名方法。这些方法可以有效地识别不可靠用户,并在判断对象质量时降低他们的权重,最终对在线产品进行更准确的评估。在本文中,我们设计了一种在准确性和稳健性方面都具有高性能的迭代排名方法。更具体地说,引入了声誉重新分配过程以增强高声誉用户的影响力,并且两个惩罚因子使算法能够抵御恶意行为。我们的方法在人工和真实用户 - 对象二分网络中都进行了验证。