Graph regularization methods for web spam detection

Jacob Abernethy, Olivier Chapelle, Carlos Castillo

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

We present an algorithm, witch, that learns to detect spam hosts or pages on the Web. Unlike most other approaches, it simultaneously exploits the structure of the Web graph as well as page contents and features. The method is efficient, scalable, and provides state-of-the-art accuracy on a standard Web spam benchmark.

Original languageEnglish
Pages (from-to)207-225
Number of pages19
JournalMachine Learning
Volume81
Issue number2
DOIs
Publication statusPublished - 1 Nov 2010
Externally publishedYes

Keywords

  • Adversarial information retrieval
  • Graph regularization
  • Spam detection
  • Web spam

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software

Cite this

Abernethy, J., Chapelle, O., & Castillo, C. (2010). Graph regularization methods for web spam detection. Machine Learning, 81(2), 207-225. https://doi.org/10.1007/s10994-010-5171-1