A Web Aggregation Approach for Distributed Randomized PageRank Algorithms

Details A Web Aggregation Approach for Distributed Randomized PageRank Algorithms A Web Aggregation Approach for Distributed Randomized PageRank Algorithms

2012-03-29

arxiv.org/abs/1203.6606v1

Computer Science

Systems and Control

To appear in the IEEE Transactions on Automatic Control, 2012

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Web Aggregation Approach for Distributed Randomized PageRank Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Web Aggregation Approach for Distributed Randomized PageRank Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Web Aggregation Approach for Distributed Randomized PageRank Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-58361