442 search results - page 1 / 89 » Local Computation of PageRank Contributions |
WAW
2007
Springer
13 years 10 months ago
2007
Springer
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
AIRWEB
2008
Springer
13 years 6 months ago
2008
Springer
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
AINA
2004
IEEE
13 years 8 months ago
2004
IEEE
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...
ECIR
2006
Springer
13 years 6 months ago
2006
Springer
Abstract. PageRank inherently is massively parallelizable and distributable, as a result of web's strict host-based link locality. In this paper we show that the Gau
WWW
2003
ACM
14 years 5 months ago
2003
ACM
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...