Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013, Article ID 438987, 8 pages
http://dx.doi.org/10.1155/2013/438987
Research Article

An Improved Approach to the PageRank Problems

1School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China
2Department of Mathematics, The University of Hong Kong, Pokfulam, Hong Kong

Received 1 August 2013; Revised 25 November 2013; Accepted 25 November 2013

Academic Editor: Zhongxiao Jia

Copyright © 2013 Yue Xie et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Brin, L. Page, R. Motwami, and T. Winograd, “The PageRank citation ranking: bringing order to the web,” Tech. Rep. 1999-0120, Computer Science Department, Stanford University, Stanford, Calif, USA, 1999. View at Google Scholar
  2. J. M. Kleinberg, “Authoritative sources in a hyperlinked environment,” Journal of the ACM, vol. 46, no. 5, pp. 604–632, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. R. Lempel and S. Moran, “The stochastic approach for link-structure analysis (SALSA) and the TKC effect,” in Proceedings of the 9th International Conference on the World Wide Web, pp. 387–401, ACM Press, New York, NY, USA, 2000.
  4. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub, “Exploiting the block structure of the web for computing PageRank,” Tech. Rep. 2003-17, Stanford University, Stanford, Calif, USA, 2003. View at Google Scholar
  5. E. Minkov, “Adaptive graph walk based similarity measures in entity-relation graphs,” type CMU-LTI-09-004, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pa, USA, 2008. View at Google Scholar
  6. T. H. Haveliwala and S. D. Kamvar, “The second eigenvalue of the Google matrix,” Tech. Rep. 2003-20, Stanford University, Stanford, Calif, USA, 2003. View at Google Scholar
  7. G. H. Golub and C. F. van Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, Md, USA, Third edition, 1996. View at MathSciNet
  8. R. S. Wills and I. C. F. Ipsen, “Ordinal ranking for Google's PageRank,” SIAM Journal on Matrix Analysis and Applications, vol. 30, no. 4, pp. 1677–1696, 2008/09. View at Publisher · View at Google Scholar · View at MathSciNet
  9. A. Arasu, J. Novak, A. Tomkins, and J. Tomlin, “PageRank computation and the structure of the web: experiments and algorithms,” in Proceedings of the 11th International World Wide Web Conference, ACM Press, New York, NY, USA, 2002.
  10. A. Broder, R. Kumar, and F. Maghoul, “Graph structure in the web: experiments and models,” in Proceedings of the 9th International World Wide Web Conference, 2000.
  11. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub, “Extrapolation methods for accelerating the computation of PageRank,” in Proceedings of the 12th International World Wide Web Conference, pp. 261–270, ACM Press, New York, NY, USA, 2003.
  12. K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova, “Monte Carlo methods in pagerank computation: when one iteration is sufficient,” SIAM Journal on Numerical Analysis, vol. 45, no. 2, pp. 890–904, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. D. F. Gleich, A. P. Gray, C. Greif, and T. Lau, “An inner-outer iteration for computing PageRank,” SIAM Journal on Scientific Computing, vol. 32, no. 1, pp. 349–371, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. C. P. Lee, G. H. Golub, and S. A. Zenios, “Partial state space aggregation based on lumpability and its application to PageRank,” Tech. Rep., Stanford University, 2003. View at Google Scholar
  15. S. D. Kamvar, T. H. Haveliwala, and G. H. Golub, “Adaptive methods for the computation of PageRank,” Tech. Rep. 2003-26, Stanford University, Stanford, Calif, USA, 2003. View at Google Scholar
  16. A. Cevahir, C. Aykanat, A. Turk, and B. B. Cambazoglu, “Site-based partitioning and repartitioning techniques for parallel pagerank computation,” IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 5, pp. 786–802, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. D. Gleich, L. Zhukov, and P. Berkhin, “Fast parallel PageRank: a linear system approach,” Tech. Rep. YRL-2004-038, 2004. View at Google Scholar
  18. C. Kohlschtter, R. Chirita, and W. Nejdl, “Efficient parallel computation of PageRank,” in Proceedings of the 28th European Conference on IR Research (ECIR '06), pp. 241–252, 2006.
  19. G. Kollias and E. Gallopoulos, “Asynchronous PageRank computation in an interactive multithreading environment,” in Proceedings of the Seminar Web Information Retrieval and Linear Algebra Algorithms, 2007.
  20. G. Kollias, E. Gallopoulos, and D. B. Szyld, “Asynchronous iterative computations with web information retrieval structures: the PageRank case,” in Proceedings of the ParCo, 2006.
  21. B. Manaskasemsak and A. Rungsawang, “An efficient partition-based parallel PageRank algorithm,” in Proceedings of the 11th International Conference on Parallel and Distributed Systems Workshops (ICPADS '05), pp. 257–263, July 2005. View at Publisher · View at Google Scholar · View at Scopus
  22. A. N. Langville and C. D. Meyer, “A reordering for the PageRank problem,” SIAM Journal on Scientific Computing, vol. 27, no. 6, pp. 2112–2120, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. A. Berman and R. J. Plemmons, Nonnegative Matrices in the Mathematical Sciences, vol. 9, SIAM, Philadelphia, Pa, USA, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  24. C. P. Lee, G. H. Golub, and S. A. Zenios, “A fast two-stage algorithm for computing PageRank and its extensions,” Tech. Rep. SCCM-03-15, Stanford University, Stanford, Calif, usa, 2003. View at Google Scholar
  25. J. Hirai, S. Raghavan, H. Garcia-Molina, and A. Paepcke, “WebBase: a repository of Web pages,” Computer Networks, vol. 33, no. 1, pp. 277–293, 2000. View at Publisher · View at Google Scholar · View at Scopus
  26. G. H. Golub and C. Greif, “Arnoldi-type algorithms for computing stationary distribution vectors, with application to PageRank,” Tech. Rep. SCCM-2004-15, Scientific Computation and Computational Mathematics, Stanford University, Stanford, Calif, USA, 2004. View at Google Scholar