Graph regularization methods for Web spam detection

DOI10.1007/S10994-010-5171-1MaRDI QIDQ1959625zbMATH OpenOpenAlexFDO

Authors Jacob Abernethy, Olivier Chapelle, Carlos Castillo

Publication date 7 October 2010

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s10994-010-5171-1

zbMATH Keywords

adversarial information retrievalgraph regularizationspam detectionWeb spam

Mathematics Subject Classification ID

Internet topics (68M11) Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1629951
• The framework of manifold regularization of ranking on graphs
• Algorithmic Challenges in Web Search Engines
• scientific article; zbMATH DE number 1706418
• Learning to rank on graphs

Cites work

• Advanced Lectures on Machine Learning
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Learning Theory
• Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
• Training a Support Vector Machine in the Primal

Cited in

(1)

• Phishing detection with popular search engines: simple and effective

This page was built for publication: Graph regularization methods for Web spam detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1959625)