SIGN IN
SIGN UP
Robust PageRank and locally computable spam detection features
Full Text:
Pdf
Get 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): 1
· Downloads (12 Months): 11
· Downloads (cumulative): 322
· Citation Count: 12
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
Recommend the ACM DL
to your organization
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Author Tags
algorithms
directed graphs
graph algorithms
graph theory
information retrieval
link spam
local algorithms
machine learning
pagerank
performance
theory
unsupervised learning
Contact Us
|
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
**
Advertisements
Powered by
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder