Graph Regularization Methods for Web Spam Detection

Jacob D. Abernethy, Olivier Chapelle, Carlos Castillo

MLJ 2010 pp. 207-225

doi:10.1007/S10994-010-5171-1 /mlj/2010/abernethy2010mlj-graph/

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.

PDF MLJ Semantic Scholar

Cite

Text

Abernethy et al. "Graph Regularization Methods for Web Spam Detection." Machine Learning, 2010. doi:10.1007/S10994-010-5171-1

Markdown

[Abernethy et al. "Graph Regularization Methods for Web Spam Detection." Machine Learning, 2010.](https://mlanthology.org/mlj/2010/abernethy2010mlj-graph/) doi:10.1007/S10994-010-5171-1

BibTeX

@article{abernethy2010mlj-graph,
  title     = {{Graph Regularization Methods for Web Spam Detection}},
  author    = {Abernethy, Jacob D. and Chapelle, Olivier and Castillo, Carlos},
  journal   = {Machine Learning},
  year      = {2010},
  pages     = {207-225},
  doi       = {10.1007/S10994-010-5171-1},
  volume    = {81},
  url       = {https://mlanthology.org/mlj/2010/abernethy2010mlj-graph/}
}