Graph regularization methods for Web spam detection

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.

• Type: Journal
• Year: 2010
• Where: ML
• Authors: Jacob Abernethy, Olivier Chapelle, Carlos Castillo
• Keywords: Machine Learning, ML 2010, Spam Hosts, Web Graph, Web Spam Benchmark