Distributed PageRank computation based on iterative aggregation- disaggregation methods

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2005, Pages 578-585

  Zhu, Yangbo ^a   Ye, Shaozhi ^b   Li, Xing ^a  

^a TSINGHUA UNIVERSITY   (China)

^b University of California   (United States)

Author keywords

Block Jacobi; Distributed search engines; Iterative aggregation disaggregation; PageRank

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; CONVERGENCE OF NUMERICAL METHODS; COSTS; GRAPH THEORY; ITERATIVE METHODS; KNOWLEDGE ENGINEERING; WEBSITES;

BLOCK JACOBI; DISTRIBUTED SEARCH ENGINES; ITERATIVE AGGREGATION-DISAGGREGATION; PAGERANK;

SEARCH ENGINES;

EID: 33745790134     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1099554.1099705     Document Type: Conference Paper

References (31)

1. P. Boldi and S. Vigna. The webgraph framework i: compression techniques. In Proc. of the WWW'04 Conf., pages 595-602, 2004.
2. A. Broder, R. Lempel, F. Maghoul, and J. Pedersen. Efficient pagerank approximation via graph aggregation. In Proc. of the WWW'04 Conf., pages 484-485, 2004.
3. W. Cao and W. Stewart. Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains. J. ACM, 32(3):702-719, 1985.
4. F. Chatelin. Iterative aggregation/disaggregation methods. In Proc. of Int. Workshop on Mathematical Computer Performance and Reliability, 1983.
5. P. Courtois and P. Semal. Block iterative algorithm for stochastic matrices. Linear Algebra and its Application, Vol 76, pages 59-70, 1986.
6. N. Eiron, K. McCurley, and J. Tomlin. Ranking the web frontier, In Proc. of the WWW'04 Conf., pages 309-318, 2004.
7. D. Gleich, L. Zhukov, and P. Berkhin. Fast parallel pagerank: A linear system approach. Technical report, Yahoo Corp., 2004.
8. G. Golub and C. V. Loan. Matrix computations (3rd ed.). Johns Hopkins Univ. Press, 1996.
9. I. Ipsen and S. Kirkland. Convergence analysis of a pagerank updating algorithm by langville and meyer. SIAM J. Matrix Anal. Appl., to appear, 2004.
10. H. Kafeety, C. Meyer, and W. Stewart. A general framework for iterative aggregation/disaggregation methods. In Proc. of the 4th Copper Mountain Conf. on Iterative Methods, 1992.
11. S. Kamvar, T. Haveliwala, and G. Golub. Adaptive methods for the computation of pagerank. Technical report, Stanford Univ., 2003.
12. S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. Exploiting the block structure of the web for computing pagerank. Technical report, Stanford Univ., 2003.
13. S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. Extrapolation methods for accelerating pagerank computations. Proc. of the WWW'03 Conf., pages 261-270, 2003.
14. L. Kaufman. Matrix methods for queueing problems. SIAM J. Sci. Statist. Comput., 4(3):525-552, 1983.
15. M. Kendall and J. Gibbons. Rank Correlation Methods. Edward Arnold, London, 5 edition, 1990.
16. J. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5):604-632, 1999.
17. A. Langville and C. Meyer. Updating pagerank with iterative aggregation. In Proc. of the WWW'04 Conf., 2004.
18. A. Langville and C. Meyer. Deeper inside pagerank. Internet Mathematics, 1(3):335-380, 2005.
19. C. Lee, G. Golub, and S. Zenios, A fast two-stage algorithm for computing pagerank and its extensions. Technical report, Stanford Univ., 2003.
20. P. Lyman, H. Varian, J. Dunn, A. Strygin, and K. Swearingen. How much information project. Technical report, Univ. of California, Berkeley, 2003.
21. I. Marek and P. Mayer. Iterative aggregation/disaggregation methods for computing some characteristics of markov chains, In Proc. of the Third Int. Conf. on Large-Scale Scientific Computing, pages 68-80, 2001.
22. I. Marek and P. Mayer. Convergence theory of some classes of iterative aggregation-disaggregation methods for computing stationary probability vectors of stochastic matrices. Linear Algebra and Its Applications, 363:177-200, 2003.
23. I. Marek and I. Pultarova. A note on local and global convergence analysis of iterative aggregation -disaggregation methods. Submitted to Linear Algebra and Applications, 2005.
24. C. Meyer. Stochastic complementation, uncoupling markov chains, and the theory of nearly reducible systems, SIAM Review, Vol. 31,:&, pages 240-272, 1989.
25. M. Neumann and R. Plemmons. Convergent nonnegative matrices and iterative methods for consistent linear systems. Numer. Math., 31:265-279, 1978.
26. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Univ., 1998.
27. G. Stewart, W. Stewart, and D. McAllister. A two stage iteration for solving nearly completely decomposable markov chains. Recent Advances in Iterative Methods, IMA Vol. Math. Appl. 60:201-216, 1993.
28. D. Szyld. The mystery of asynchronous iterations convergence when the spectral radius is one. Research Report 98-102, Temple Univ., 1998.
29. Y. Takahashi. A lumping method for numerical calculations of stationary distributions of markov chains. Technical Report B-18, Dept. of Information Sciences, Tokyo Institute of Technology, 1975.
30. H. Vantilborgh, The error of aggregation in decomposable systems. Technical Report R453, Philipps Research Laboratory, Brussels, Belgium, 1981.
31. Y. Wang and D. DeWitt. Computing pagerank in a distributed internet search engine system. In Proc. of VLDB'04 Conf., pages 420-431, 2004.