Gang Wu
Abstract
PageRank is one of the most important ranking techniques used in today's search engines. A recent very interesting research track focuses on exploiting efficient numerical methods to speed up the computation of PageRank, among which the Arnoldi-type algorithm and the GMRES algorithm are competitive candidates. In essence, the former deals with the PageRank problem from an eigenproblem, while the latter from a linear system, point of view. However, there is little known about the relations between the two approaches for PageRank. In this article, we focus on a theoretical and numerical comparison of the two approaches. Numerical experiments illustrate the effectiveness of our theoretical results.
- Bao, Y., Feng, G., Liu, T., Ma, Z., and Wang, Y. 2006. Ranking websites, a probabilistic view. Internet Math. 3, 3, 295--320.Google Scholar
Cross Ref
- Berkhin, P. 2005. A survey on pagerank computing. Internet Math. 2, 1, 73--120.Google ScholarCross Ref
- Berman, A. and Plemmons, R. 1994. Nonnegative Matrices in the Mathematical Sciences 2nd Ed. SIAM, Philadelphia.Google Scholar
- Boldi, P., Santini, M., and Vigna, S. 2007. A deeper investigation of pagerank as a function of the damping factor. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings. no. 07071. http://drops.dagstuhl.de/opus/volltexte/2007/1072/pdf/07071.VignaSebastiano. Paper.1072.pdf.Google Scholar
- Cipra, B. 2000. The best of the 20th century: Editors name top 10 algorithms. SIAM News 33, 4.Google Scholar
- Corso, G. D., Gullì, A., and Romani, F. 2006. Fast pagerank via a sparse linear system. Internet Math. 2, 3, 251--273.Google ScholarCross Ref
- Corso, G. D., Gullì, A., and Romani, F. 2007. Comparison of Krylov subspace methods on the pagerank problem. J. Comput. Appl. Math. 210, 1-2, 159--166. Google ScholarDigital Library
- Gleich, D., Zhukov, L., and Berkhin, P. 2005. Fast parallel pagerank: A linear system approach. Yahoo! Tech. Rep.Google Scholar
- Golub, G. and Greif, C. 2006. An Arnoldi-type algorithm for computing pagerank. BIT 46, 4, 759--771.Google ScholarDigital Library
- Golub, G. and Van-Loan, C. 1996. Matrix Computations 3rd Ed. The Johns Hopkins University Press, Baltimore. Google ScholarDigital Library
- Jia, Z. 1999. Composite orthogonal projection methods for large matrix eigenproblems. Sci. China (Series A) 42, 6, 577--585.Google ScholarCross Ref
- Langville, A. and Meyer, C. 2006. Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, NJ. Google ScholarDigital Library
- Lin, Y., Shi, X., and Wei, Y. 2009. On computing pagerank via lumping the Google matrix. J. Comput. Appl. Math. 224, 2, 702--708. Google ScholarDigital Library
- MATLAB. 1994. MATLAB 7. The MATHWORKS INC.Google Scholar
- Moler, C. 2002. The world's largest matrix computation. MATLAB News and Notes 12--13.Google Scholar
- Page, L., Brin, S., Motwami, R., and Winograd, T. 1998. The pagerank citation ranking: Bring order to the Web. Tech. rep., Computer Science Department, Stanford University.Google Scholar
- Saad, Y. 1992. Numerical Methods for Large Eigenvalue Problems. Algorithms and Architectures for Advanced Scientific Computing. Manchester University Press.Google Scholar
- Saad, Y. 2003. Iterative Methods for Sparse Linear Systems 2nd Ed. SIAM, Philadelphia, PA. Google ScholarDigital Library
- Saad, Y. and Schultz, M. 1986. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7, 3, 856--869. Google ScholarDigital Library
- Schneider, O. 2006. Krylov subspace methods for computing stationary probability distributions of CTMC. In Proceedings of the GAMM-SIAM Linear Algebra Conference.Google Scholar
- Simoncini, V. 2000. On the convergence of restarted Krylov subspace methods. SIAM Matrix Anal. Appl. 22, 2, 430--452. Google ScholarDigital Library
- Wang, G., Wei, Y., and Qiao, S. 2004. Generalized Inverses: Theory and Computations. Science Press, Beijing.Google Scholar
- Wills, R. and Ipsen, I. 2009. Ordinal ranking for Google's pagerank. SIAM Matrix Anal. Appl. 30, 4, 1677--1696. Google ScholarDigital Library
- Wu, G. and Wei, Y. 2007. A power-Arnoldi algorithm for computing pagerank. Numer. Linear Algebra Appl. 14, 7, 521--546.Google ScholarCross Ref
- Wu, G. and Wei, Y. 2009a. Accelerated Arnoldi-type algorithms for computing stationary distribution with application to the pagerank and the generank problems. To appear.Google Scholar
- Wu, G. and Wei, Y. 2009b. An Arnoldi-extrapolation algorithm for computing pagerank. J. Comput. Appl. Math. Accepted. Google ScholarDigital Library
- Zavorin, I., O'Leary, D., and Elman, H. 2003. Complete stagnation of GMRES. Linear Algebra Appl. 367, 1, 165--183.Google ScholarCross Ref
- Zhang, H., Goel, A., Govindan, R., Mason, K., and Roy, B. V. 2004. Making eigenvector-based reputation system robust to collusion. Lecture Notes in Computer Science vol. 3243, 92--104.Google ScholarCross Ref
Index Terms
- Arnoldi versus GMRES for computing pageRank: A theoretical contribution to google's pageRank problem
Recommendations
An Arnoldi-Extrapolation algorithm for computing PageRank
The Arnoldi-type algorithm proposed by Golub and Greif [G. Golub, C. Greif, An Arnoldi-type algorithm for computing PageRank, BIT 46 (2006) 759-771] is a restarted Krylov subspace method for computing PageRank. However, this algorithm may not be ...
Accelerating the Arnoldi-Type Algorithm for the PageRank Problem and the ProteinRank Problem
PageRank is an algorithm for computing a ranking for every Web page based on the graph of the Web. It plays an important role in Google's search engine. The core of the PageRank algorithm involves computing the principal eigenvector of the Google ...
A Googol of Information about Google
Timothy P. Chartier reviews Google's PageRank and Beyond: The Science of Search Engine Rankings by Amy Langville and Carl Meyer.
Comments