Kyung Soo Kim
ABSTRACT
As the search services have been widely available on the web, page-ranking algorithm gained great attention in the recent decade. PageRank is the most popular ranking scheme that is currently well-known even to the public. PageRank uses a hyperlink matrix which represents the whole web structure and the size of the web is incredibly large in general so that a fast calculation method is needed to efficiently compute an enormous number of page ranks on the web. In this paper, we propose a new PageRank computation method, incremental iteration method in order to considerably reduce total computational cost. Our method makes good use of faster convergence procedure of power iteration than conventional one. Additionally, our method can be effectively combined with other conventional methods for more reduction of computational cost. In experiment, we demonstrate efficiency and effectiveness of our proposed method.
- Basharin, Gely P., Langville, Amy N., and Vaumov, Valeriy A. 2004. The life and work of A. A. Markov. Linear Algebra and Its Applications, 386, 3--26.Google Scholar
Cross Ref
- Page, L., Brin, S., Motwani, R., and Winograd, T. 1998. The PageRank Citation Ranking: Bringing Order to the web. Stanford Digital Library Technologies.Google Scholar
- Desikan, P. and Srivastava, J. 2004, Mining Temporally Evolving Graphs. webKDD Workshop, Seattle.Google Scholar
- Haveliwala, T. 1999. Efficient Computation of PageRank, Stanford University Technical Report (September 1999).Google Scholar
- Desikan, P., Srivastava, J., Kumar, V., and Tan, P. N. 2002. Hyperlink Analysis - Techniques & Applications. Army High Performance Computing Center Technical Report (2002).Google Scholar
- Kleinberg, Jon. 1999. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46. Google ScholarDigital Library
- Bicardo, B. Y. and Berthier, R. N. 1999. Modern Information Retrieval. ACM Press, New York. Google ScholarDigital Library
- Lempel, R. and Moran, S. 2000. The stochastic approach for link-structure analysis (SALSA) and the TKC effect. In The Ninth International World Wide web Conference, New York, ACM Press. Google ScholarDigital Library
- Hunter, Jeffrey J. 1986. Stationary distributions of perturbed Markov chains. Linear Algebra and Its Application, 82, 201--214.Google ScholarCross Ref
- Parlett, Beresford N. 1998. The Symmetric Eigenvalue Problem. SIAM. Google ScholarDigital Library
- Thorson, K. 2004. Modeling the web and the computation of PageRank. Undergraduate thesis, Hollins University.Google Scholar
- Desikab, P., Pathak, N., Srivastava, J., and Kumar, V. 2005. Incremental Page Rank Computation on evolving graphs. In International World Wide web Conference (2005). Google ScholarDigital Library
- Langville, Amy N. and Meyer, Carl D. 2006. Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, New Jersey. Google ScholarDigital Library
- Pierre, B., Paolo, F., and Padhraic, S. 2003. Modeling the Internet and the web: Probabilistic methods and algorithms (2003), Wiley.Google Scholar
- Arasu, A., Novak, J., Tomkins, A., and Tomlin, J. 2002. Pagerank computation and the structure of the web: Experiments and algorithms. International World Wide web Conference (2002), poster.Google Scholar
- Kamvar, S. D., Haveliwala, T. H., Manning, C. D., and Golub, G. H. 2003. Extrapolation methods for accelerating PageRank computations. International World Wide Web Conference (2003). Google ScholarDigital Library
Index Terms
- Incremental iteration method for fast PageRank computation
Recommendations
Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of visiting a Web page by a random surfer, and thus it reflects the popularity of a Web page. Google computes the PageRank ...
Lumping Method with Acceleration for the PageRank Computation
ICCSA '14: Proceedings of the 2014 14th International Conference on Computational Science and Its ApplicationsWeb information retrieval is extremely challenging due to the huge number of web pages. The success of a search engine relies on its capacity to deploy fast, accurately and in order, a set of results satisfying a particular query. To determine the order ...
Associated pagerank: improved pagerank measured by frequent term sets
VECIMS'09: Proceedings of the 2009 IEEE international conference on Virtual Environments, Human-Computer Interfaces and Measurement SystemsWeb search engines encounter many new challenges while the amount of information on the web increases rapidly. Web documents have been a main resource for various purposes, and people rely on search engines to retrieve the desired documents. This paper ...
Comments