论文信息 - Making Eigenvector-Based Reputation Systems Robust to Collusion

Making Eigenvector-Based Reputation Systems Robust to Collusion

Eigenvector based methods in general, and Google’s PageRank algorithm for rating web pages in particular, have become an important component of information retrieval on the Web. In this paper, we study the efficacy of, and countermeasures for, collusions designed to improve user rating in such systems.

[1] U. Feige,et al. On the densest k-subgraph problems , 1997 .

[2] Krishna Bharat,et al. Improved algorithms for topic distillation in a hyperlinked environment , 1998, SIGIR '98.

[3] Jon M. Kleinberg,et al. Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text , 1998, Comput. Networks.

[4] M. KleinbergJon. Authoritative sources in a hyperlinked environment , 1999 .

[5] Rajeev Motwani,et al. The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[6] Fan Chung Graham,et al. A random graph model for massive graphs , 2000, STOC '00.

[7] Michael I. Jordan,et al. Link Analysis, Eigenvectors and Stability , 2001, IJCAI.

[8] Chrysanthos Dellarocas,et al. Analyzing the economic efficiency of eBay-like online reputation reporting mechanisms , 2011, EC '01.

[9] P. Resnick,et al. Eliciting Honest Feedback in Electronic Markets , 2002 .

[10] Wei Zhang,et al. Improvement of HITS-based algorithms on web documents , 2002, WWW '02.

[11] Taher H. Haveliwala. Topic-sensitive PageRank , 2002, IEEE Trans. Knowl. Data Eng..

[12] H. T. Kung,et al. DIFFERENTIATED ADMISSION FOR PEER-TO-PEER SYSTEMS: INCENTIVIZING PEERS TO CONTRIBUTE THEIR RESOURCES , 2003 .

[13] Hector Garcia-Molina,et al. EigenRep: Reputation Management in P2P Networks , 2003 .

[14] Hector Garcia-Molina,et al. Combating Web Spam with TrustRank , 2004, VLDB.

[15] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.