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. © 2010 The Author(s).
Author supplied keywords
Cite
CITATION STYLE
APA
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
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free