Using Rank Propagation and Probabilistic Counting for Link-Based Spam Detection (2006)
| Venue: | In Proceedings of the Workshop on Web Mining and Web Usage Analysis (WebKDD |
| Citations: | 26 - 12 self |
BibTeX
@INPROCEEDINGS{Becchetti06usingrank,
author = {Luca Becchetti and Carlos Castillo and Debora Donato and Stefano Leonardi and Ricardo Baeza-Yates},
title = {Using Rank Propagation and Probabilistic Counting for Link-Based Spam Detection},
booktitle = {In Proceedings of the Workshop on Web Mining and Web Usage Analysis (WebKDD},
year = {2006},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
