On Arnoldi Method Accelerating PageRank Computations | SpringerLink
Skip to main content
Springer Nature Link
Log in

On Arnoldi Method Accelerating PageRank Computations

  • Conference paper
Web Information Systems and Mining (WISM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6318))

Included in the following conference series:

  • 3094 Accesses

Abstract

PageRank is a very important ranking algorithm in web information retrieval or search engine. We present Power method with Arnoldi acceleration for the computation of Pagerank vector, which can take the advantage of both Power method and Arnoldi process. The description and implementation of the new algorithm are discussed in detail. Numerical results illustrate that our new method is efficient and faster than the existing counterparts.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Arnoldi, W.E.: The principle of minimized iteration in the solution of the matrix eigenvalue problem. Quart. Appl. Math. 9, 17–29 (1951)

    Article  MathSciNet  MATH  Google Scholar 

  2. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web, Standford Digital Libraries Working Paper (1998)

    Google Scholar 

  3. Berkhin, P.: A survey on PageRank computing. Internet Mathematics 2, 73–120 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Golub, G.H., Greif, C.: An Arnoldi-type algorithm for computing PageRank. BIT Numerical Mathematics 46, 759–771 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Internet Mathematics 1, 335–380 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kamvar, S.D., Haveliwala, T.H., Golub, G.H.: Adaptive methods for the computation of PageRank. Linear Algebra Appl. 386, 51–65 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Extrapolation methods for accelerating PageRank computations. In: Proceedings of the Twelfth International World Wide Web Conference (2003)

    Google Scholar 

  8. Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Exploiting the block structure of the web for computing PageRank. Stanford University Technical Report, SCCM-03-02 (2003)

    Google Scholar 

  9. Haveliwala, T.H., Kamvar, S.D.: The second eigenvalue of the Google matrix. In: Proceedings of the Twelfth International World Wide Web Conference (2003)

    Google Scholar 

  10. Wu, G., Wei, Y.: A Power–Arnoldi algorithm for computing PageRank. Numer. Linear Algebra Appl. 14, 521–546 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Sleijpen, G.L.G., Van der Vorst, H.A.: A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Mat. Anal. Appl. 17, 401–425 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  12. Bellalij, M., Saad, Y., Sadok, H.: On the convergence of the Arnoldi process for eigenvalue problems. Report umsi-2007-12, Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Tongji University, 1239 Siping Road, Shanghai, 200092, P.R. China

    Guo-Jian Yin & Jun-Feng Yin

Authors
  1. Guo-Jian Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun-Feng Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Business Administration, Caritas Francis Hsu College, 18 Chui Ling Road, Tseung Kwan O, Hong Kong, China

    Fu Lee Wang

  2. Department of Computer and Inforamtion Science, University of Macau, Av. Padre Tomás Pereira, Taipa, Macau, SAR, China

    Zhiguo Gong

  3. School of Computer, Shanghai University, 99 Shangda Road, 200444, Shanghai, China

    Xiangfeng Luo

  4. School of Computer, Nanjing University of Posts and Telecommunications, 210003, Nanjing, China

    Jingsheng Lei

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yin, GJ., Yin, JF. (2010). On Arnoldi Method Accelerating PageRank Computations. In: Wang, F.L., Gong, Z., Luo, X., Lei, J. (eds) Web Information Systems and Mining. WISM 2010. Lecture Notes in Computer Science, vol 6318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16515-3_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16515-3_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16514-6

  • Online ISBN: 978-3-642-16515-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics