Robust PageRank and locally computable spam detection features

doi:10.1145/1451983.1452000

Robust PageRank and locally computable spam detection features

Full Text:

Pdf

Buy this Article

Authors:	Reid Andersen	Microsoft Research, Redmond
	Christian Borgs	Microsoft Research, Redmond
	Jennifer Chayes	Microsoft Research, Redmond
	John Hopcroft	Cornell University
	Kamal Jain	Microsoft Research, Redmond
	Vahab Mirrokni	Microsoft Research, Redmond
	Shanghua Teng	Boston University

	2008 Article
Bibliometrics
· Downloads (6 Weeks): 7 · Downloads (12 Months): 41 · Downloads (cumulative): 259 · Citation Count: 10

Published in:

· Proceeding

AIRWeb '08 Proceedings of the 4th international workshop on Adversarial information retrieval on the web

Pages 69-76
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-60558-159-0 doi>10.1145/1451983.1452000

Tools and Resources

Buy this Article
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms directed graphs graph algorithms graph theory information search and retrieval learning link spam local algorithms pagerank performance theory unsupervised learning

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder