Sciweavers

1839 search results - page 5 / 368
» Efficient Parallel Computation of PageRank
Sort
View
WWW
2005
ACM
14 years 8 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
IPM
2008
133views more  IPM 2008»
13 years 7 months ago
DistanceRank: An intelligent ranking algorithm for web pages
A fast and efficient page ranking mechanism for web crawling and retrieval remains as a challenging issue. Recently, several link based ranking algorithms like PageRank, HITS and ...
Ali Mohammad Zareh Bidoki, Nasser Yazdani
ICDCS
2005
IEEE
14 years 1 months ago
Using a Layered Markov Model for Distributed Web Ranking Computation
The link structure of the Web graph is used in algorithms such as Kleinberg’s HITS and Google’s PageRank to assign authoritative weights to Web pages and thus rank them. Both ...
Jie Wu, Karl Aberer
WWW
2004
ACM
14 years 8 months ago
Efficient pagerank approximation via graph aggregation
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Ja...
CIKM
2008
Springer
13 years 9 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell