Graph regularization methods for Web spam detection

Jacob D. Abernethy, Olivier Chapelle, Carlos Castillo

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.