Using Rank Propagation and Probabilistic Counting for Link-Based Spam Detection (2006) [17 citations — 10 self]
Download:
http://www.dcc.uchile.cl/~ccastill/papers/becchett
http://webmining.spd.louisville.edu/webkdd06/paper
CACHED:
http://www.dcc.uchile.cl/~ccastill/papers/becchett
http://webmining.spd.louisville.edu/webkdd06/paper
CACHED:
by
Luca Becchetti
,
Carlos Castillo
,
Debora Donato
,
Stefano Leonardi
,
Ricardo Baeza-Yates
In Proceedings of the Workshop on Web Mining and Web Usage Analysis (WebKDD
Add To MetaCart
Abstract:
This paper describes a technique for automating the detection of Web link spam, that is, groups of pages that are linked together with the sole purpose of obtaining an undeservedly high score in search engines. The problem of Web spam is widespread and di#cult to solve, mostly due to the large size of web collections that makes many algorithms unfeasible in practice.

