Skip to main content
SpringerLink
Log in
Book cover

Network Performance Engineering pp 548–570Cite as

An Algebraic Multigrid Solution of Large Hierarchical Markovian Models Arising in Web Information Retrieval

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 5233))

Abstract

In Web information retrieval stochastic link analysis provides important supplementary means to generate a ranking of searched objects. Considering a hierarchical algebraic description of a Web graph with host-oriented clustering of pages or a role-oriented perspective, we propose an efficient computation of the stationary distribution of the underlying homogeneous Markov chain of a random surfer by iterative aggregation/disaggregation procedures and algebraic multigrid methods. In particular, we discuss the application of an efficient multigrid variant of the multiplicative Schwarz iteration which can be performed on a single machine with limited storage requirements.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   179.00
Price excludes VAT (USA)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baldi, P., et al.: Modeling the Internet and the Web - Probabilistic Methods and Algorithms. John Wiley & Sons, Chichester (2003)

    Google Scholar 

  2. Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. Academic Press, New York (1979)

    MATH  Google Scholar 

  3. Cao, W., Stewart, W.J.: Iterative aggregation/disaggregation techniques for nearly uncoupled Markov chains. Journal of the ACM 32, 702–719 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chatelin, F., Miranker, W.L.: Acceleration by aggregation of successive approximation methods. Linear Algebra and its Applications 43, 17–47 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks. Oxford University Press, New York (2003)

    Book  MATH  Google Scholar 

  6. Douglas, C.C., Miranker, W.L.: Constructive interference in parallel algorithms. SIAM J. Numer. Analysis 25(2), 376–398 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  7. Golub, G.H., van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins, Baltimore (1996)

    MATH  Google Scholar 

  8. Kumar, S. D., et al.: Exploiting the block structure of the Web for computing PageRank. Stanford University Technical Report (2003), http://citeseer.ist.psu.edu/kamvar03exploiting.html

  9. Hackbusch, W.: Iterative Lösung großer schwachbesetzter Gleichungssysteme. Teubner, Stuttgart (1991)

    Book  MATH  Google Scholar 

  10. Haviv, M.: Aggregation/disaggregation methods for computing the stationary distribution of a Markov chain. SIAM J. Numer. Analysis 24(4), 952–966 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  11. Horton, G., Leutenegger, S.: A multilevel solution algorithm for steady-state Markov chains. In: Proc. SIGMETRICS 1994, Nashville, May 16-20 (1994)

    Google Scholar 

  12. Kammenhuber, N., Luxenburger, J., Feldmann, A., Weikum, G.: Web search clickstreams. In: Internet Measurement Conference 2006, pp. 245–250 (2006)

    Google Scholar 

  13. Krashakov, S.A., Teslyuk, A.B., Shchur, L.N.: On the universality of rank distributions of website popularity. Computer Networks 50(11), 1769–1780 (2006)

    Article  MATH  Google Scholar 

  14. Krieger, U.R., Müller-Clostermann, B., Sczittnick, M.: Modeling and analysis of communication systems based on computational methods for Markov chains. IEEE Journal on Selected Areas in Communications 8(9), 1630–1648 (1990)

    Article  Google Scholar 

  15. Krieger, U.R.: On a two-level multigrid solution method for finite Markov chains. Linear Algebra and its Applications 223/224, 415–438 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  16. Krieger, U.R.: Numerical solution of large finite Markov chains by algebraic multigrid techniques. In: Stewart, W.J. (ed.) Computations with Markov Chains, pp. 403–424. Kluwer, Boston (1995)

    Chapter  Google Scholar 

  17. Langville, A.N., Meyer, C.D.: Google’s Pagerank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)

    MATH  Google Scholar 

  18. Lempel, R., Moran, S.: SALSA: the stochastic approach for link-structure analysis. ACM Trans. Information Systems 19, 131–160 (2001)

    Article  Google Scholar 

  19. Mandel, J., Sekerka, B.: A local convergence proof for the iterative aggregation method. Linear Algebra and its Applications 51, 163–172 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  20. Ng, A.Y., et al.: Stable algorithms for link analysis. In: Proc. 24th Ann. Int. ACM SIGIR Conf., pp. 258–266 (2001)

    Google Scholar 

  21. Schneider, H.: Theorems on M-splittings of a singular M-matrix which depend on graph structure. Linear Algebra and its Applications 58, 407–424 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  22. Schweitzer, P.J.: A survey of aggregation-disaggregation in large Markov chains. In: Stewart, W.J. (ed.) Numerical Solution of Markov Chains, pp. 63–88. Marcel Dekker, New York (1991)

    Google Scholar 

  23. Schweitzer, P.J., Kindle, K.W.: An iterative aggregation-disaggregation algorithm for solving linear equations. Applied Mathematics and Computation 18, 313–353 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  24. Wang, Q., et al.: Improving link analysis through considering hosts and blocks. In: Proc. IEEE/WIC/ACM Int. Conference on Web Intelligence 2006 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty Information Systems and Applied Computer Science, Otto-Friedrich University, Feldkirchenstr. 21, D-96052, Bamberg, Germany

    Udo R. Krieger

Authors
  1. Udo R. Krieger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, Informatics and Media, University of Bradford, Richmond Road, BD7 1DP, Bradford, UK

    Demetres D. Kouvatsos

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Krieger, U.R. (2011). An Algebraic Multigrid Solution of Large Hierarchical Markovian Models Arising in Web Information Retrieval. In: Kouvatsos, D.D. (eds) Network Performance Engineering. Lecture Notes in Computer Science, vol 5233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02742-0_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02742-0_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02741-3

  • Online ISBN: 978-3-642-02742-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation