On Accelerating the PageRank Computation
Osborne, Steve ; Rebaza, Jorge ; Wiggins, Elizabeth
Internet Math., Tome 6 (2009) no. 1, p. 157-172 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
In this paper we consider the problem of computing the PageRank vector in an efficient way. By combining some of the existing techniques and different approaches, including the power method, linear systems, iterative aggregation/disaggregation, and matrix reorderings, we propose algorithms that decrease the number of iterations to reach the desired solution, thus accelerating convergence to the vector that contains the importance of web pages.
Publié le : 2009-05-15
Classification:  
@article{1285339071,
     author = {Osborne, Steve and Rebaza, Jorge and Wiggins, Elizabeth},
     title = {On Accelerating the PageRank Computation},
     journal = {Internet Math.},
     volume = {6},
     number = {1},
     year = {2009},
     pages = { 157-172},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1285339071}
}

Osborne, Steve; Rebaza, Jorge; Wiggins, Elizabeth. On Accelerating the PageRank Computation. Internet Math., Tome 6 (2009) no. 1, pp.  157-172. http://gdmltest.u-ga.fr/item/1285339071/