Using a Layered Markov Model for Decentralized Web Ranking

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. In HITS, a solid theoretical model is lacking and the algorithm often leads to non-unique or non-intuitive rankings where zero weights may inappropriately be assigned to parts of a network. In PageRank, a model of random walks is proposed such that the theory about the stationary state of a Markov process can be applied to assure convergence to a unique ranking. Both algorithms require a centralized computation of the ranking 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 approaches for computation of ranking of Web documents, a centralized one and a decentralized one. Both produce a well-defined ranking for a given Web graph. We then formally prove that the two approaches are equivalent. This provides a theoretical foundation for decomposing link-based rank computation and makes the computation for a Web-scale graph feasible in a decentralized fashion, such as required for Web search engines having a peer-to-peer architecture. Furthermore, personalized rankings can be produced by adapting the computation at both the local layer and the global layer. Our empirical results show that the ranking generated by our model is qualitatively comparable to or even better than the ranking produced by PageRank.


 Record created 2005-07-13, last modified 2018-03-17

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)