Graph regularization methods for Web spam detection

Authors:
Jacob Abernethy;Olivier Chapelle;Carlos Castillo
Affiliations:
University of California, Berkeley, USA;Yahoo! Research, Santa Clara, USA;Yahoo! Research, Barcelona, Spain
Venue:
Machine Learning
Year:
2010

Citing 0
Cited 7

Machine learning in adversarial environments

Machine Learning
Image classification using the web graph

Proceedings of the international conference on Multimedia
Adversarial Web Search

Foundations and Trends in Information Retrieval
Survey on web spam detection: principles and algorithms

ACM SIGKDD Explorations Newsletter
Automatic seed set expansion for trust propagation based anti-spam algorithms

Information Sciences: an International Journal
Russian web spam evolution: yandex experience

Proceedings of the 22nd international conference on World Wide Web companion
Solving graph data issues using a layered architecture approach with applications to web spam detection

Neural Networks

Quantified Score

Hi-index	0.00

Visualization

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.