Back to Search
Start Over
A Web Aggregation Approach for Distributed Randomized PageRank Algorithms.
- Source :
- IEEE Transactions on Automatic Control; Nov2012, Vol. 57 Issue 11, p2703-2717, 15p
- Publication Year :
- 2012
-
Abstract
- The PageRank algorithm employed at Google assigns a measure of importance to each web page for rankings in search results. In our recent papers, we have proposed a distributed randomized approach for this algorithm, where web pages are treated as agents computing their own PageRank by communicating with linked pages. This paper builds upon this approach to reduce the computation and communication loads for the algorithms. In particular, we develop a method to systematically aggregate the web pages into groups by exploiting the sparsity inherent in the web. For each group, an aggregated PageRank value is computed, which can then be distributed among the group members. We provide a distributed update scheme for the aggregated PageRank along with an analysis on its convergence properties. The method is especially motivated by results on singular perturbation techniques for large-scale Markov chains and multi-agent consensus. A numerical example is provided to illustrate the level of reduction in computation while keeping the error in rankings small. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189286
- Volume :
- 57
- Issue :
- 11
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Automatic Control
- Publication Type :
- Periodical
- Accession number :
- 83329138
- Full Text :
- https://doi.org/10.1109/TAC.2012.2190161