| | |
Summary: Using a Layered Markov Model for Distributed Web Ranking Computation
Jie Wu
School of Comp. and Comm. Sciences
Ecole Polytechnique F´ed´erale de Lausanne
1015 Lausanne, Switzerland
jie.wu@epfl.ch
Karl Aberer
School of Comp. and Comm. Sciences
Ecole Polytechnique F´ed´erale de Lausanne
1015 Lausanne, Switzerland
karl.aberer@epfl.ch
Abstract
The link structure of the Web graph is used in algo-
rithms such as Kleinberg's HITS and Google's PageRank
to assign authoritative weights to Web pages and thus rank
them. Both require a centralized computation of the rank-
ing if used to rank the complete Web graph. In this paper,
we propose a new approach based on a Layered Markov
Model to distinguish transitions among Web sites and Web
documents. Based on this model, we propose two different
|
