Abstract
PageRank is a numerical method that Google uses to compute a page’s importance, by assigning a score to every web page. PageRank is thus at the basis of Google’s search engine success and can be mathematically explored either as an eigenvalue problem or as the solution of a homogeneous linear system. In both cases the Google matrix involved is large and sparse, so tuned algorithms must be developed to tackle it with the lowest computational cost and minimum memory requirements. One of such tunings is the Lumping method approach. Furthermore, the accuracy of the ranking vector needs not to be very precise, so inexpensive iterative methods are preferred. In this work the recent Matrix Analogue of the Accelerated Overrelaxation (MAAOR) iterative method is explored for the PageRank computation. Additionally Lumping methods have been applied to the eigenproblem formulation and we propose a novel approach combining the Lumping and MAAOR methods for the solution of the linear system. Numerical experiments illustrating the MAAOR method and the MAAOR method combined with Lumping techniques applied to PageRank computations are presented.
Similar content being viewed by others
References
Brin, S., Page, L.: Reprint of: the anatomy of a large-scale hypertextual web search engine. Comput. Netw. 56(18), 3825–3833 (2012)
Brezinski, C., Redivo-Zaglia, M.: The PageRank vector: properties, computation, approximation, and acceleration. SIAM J. Matrix Anal. Appl. 28(2), 551–575 (2006)
Mendes, I., Vasconcelos, P.: Lumping method with acceleration for the PageRank computation. In: 2014 14th International Conference on Computational Science and Its Applications, Guimarães. IEEE Conference Publications, pp. 221–224 (2014)
Ipsen, I., Selee, T.: PageRank computation, with special attention to dangling nodes. SIAM J. Matrix Anal. Appl. 29(4), 1281–1296 (2007)
Lin, Y., Shee, X., Wei, Y.: On computing PageRank via lumping the Google matrix. J. Comput. Appl. Math. 224(2), 702–708 (2009)
Yu, O., Miao, Z., Wu, G., Wei, Y.: Lumping algorithms for computing Google’s PageRank and its derivative, with attention to unreferenced nodes. Inf. Retr. 15(6), 503–526 (2012)
Hadjidimos, A.: The matrix analogue of the scalar AOR iterative method. J. Comput. Appl. Math. 288, 366–378 (2015)
Langville, A., Meyer, C.: Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2011)
Golub, G., Van Loan, C.: Matrix Computations. JHU Press, Baltimore (2012)
Meyer, C.: Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia (2000)
Arasu, A., Novak, J., Tomkins, A., Tomlin, J.: PageRank computation and the structure of the web: experiments and algorithms. In: Proceedings of the Eleventh International World Wide Web Conference, Poster Track, pp. 107–117 (2002)
Del Corso, G., Gulli, A., Romani, F.: Fast PageRank computation via a sparse linear system. Internet Math. 2(3), 251–273 (2005)
Gleich, D., Zhukov, L., Berkhin, P.: Fast parallel PageRank: a linear system approach. Yahoo! Research Technical Report YRL-2004-038, vol. 13 (2004)
Langville, A., Meyer, C.: A reordering for the PageRank problem. SIAM J. Sci. Comput. 27(6), 2112–2120 (2006)
Del Corso, G., Gulli, A., Romani, F.: Exploiting Web Matrix Permutations to Speedup PageRank Computation. Technical Report IIT TR-04, Istituto di Informatica e Telematica (2004)
Hadjidimos, A.: Accelerated overrelaxation method. Math. Comput. 32(141), 149–157 (1978)
James, K.: Convergence of matrix iterations subject to diagonal dominance. SIAM J. Numer. Anal. 10(2), 478–484 (1973)
Song, Y.: On the convergence of the generalized AOR method. Linear Algebra Appl. 256, 199–218 (1997)
Hadjidimos, A., Tzoumas, M.: On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method. J. Optim. Theory Appl. 165(2), 545–562 (2015)
Wu, G., Wang, Y.C., Jin, X.Q.: A preconditioned and shifted GMRES algorithm for the PageRank problem with multiple damping factors. SIAM J. Sci. Comput. 34(5), A2558–A2575 (2012)
Author information
Authors and Affiliations
Corresponding author
Additional information
P. B. Vasconcelos was partially supported by CMUP (UID/MAT/00144/2013), which is funded by FCT (Portugal) with national (MEC) and European structural funds through the programs FEDER, under the Partnership Agreement PT2020.
Rights and permissions
About this article
Cite this article
Mendes, I.R., Vasconcelos, P.B. PageRank Computation with MAAOR and Lumping Methods. Math.Comput.Sci. 12, 129–141 (2018). https://doi.org/10.1007/s11786-018-0335-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-018-0335-7