Using spam farm to boost PageRank

Nowadays web spamming has emerged to take the economic advantage of high search rankings and threatened the accuracy and fairness of those rankings. Understanding spamming techniques is essential for evaluating the strength and weakness of a ranking algorithm, and for fighting against web spamming. In this paper, we identify the optimal spam farm structure under some realistic assumptions in the single target spam farm model. Our result extends the optimal spam farm claimed by Gyöngyi and Garcia-Molina through dropping the assumption that leakage is constant. We also characterize the optimal spam farms under additional constraints, which the spammer may deploy to disguise the spam farm by deviating from the unconstrained optimal structure.

[1]  Taher H. Haveliwala,et al.  Adaptive methods for the computation of PageRank , 2004 .

[2]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Carl D. Meyer,et al.  Deeper Inside PageRank , 2004, Internet Math..

[4]  Brian D. Davison,et al.  Identifying link farm spam pages , 2005, WWW '05.

[5]  András A. Benczúr,et al.  SpamRank -- Fully Automatic Link Spam Detection , 2005, AIRWeb.

[6]  John G. Kemeny,et al.  Finite Markov Chains. , 1960 .

[7]  Franco Scarselli,et al.  Inside PageRank , 2005, TOIT.

[8]  Hector Garcia-Molina,et al.  Link Spam Alliances , 2005, VLDB.

[9]  Hector Garcia-Molina,et al.  Spam: it's not just for inboxes anymore , 2005, Computer.

[10]  Hector Garcia-Molina,et al.  Web Spam Taxonomy , 2005, AIRWeb.

[11]  Eli Upfal,et al.  Using PageRank to Characterize Web Structure , 2002, Internet Math..

[12]  Eric J. Friedman,et al.  Manipulability of PageRank under Sybil Strategies , 2006 .

[13]  Malik Magdon-Ismail,et al.  Optimal Link Bombs are Uncoordinated , 2005, AIRWeb.

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

[15]  Oscar Volij,et al.  The Measurement of Intellectual Influence , 2002 .

[16]  B. Nordstrom.  FINITE MARKOV CHAINS , 2005 .

[17]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[18]  Rajeev Motwani,et al.  Stratified Planning , 2009, IJCAI.

[19]  Steve Chien,et al.  Link Evolution: Analysis and Algorithms , 2004, Internet Math..

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

[21]  Marc Najork,et al.  Spam, damn spam, and statistics: using statistical analysis to locate spam web pages , 2004, WebDB '04.

[22]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .