Affiliation:
1. Xuzhou Normal University
2. Fudan University, Shanghai
Abstract
PageRank is one of the most important ranking techniques used in today's search engines. A recent very interesting research track focuses on exploiting efficient numerical methods to speed up the computation of PageRank, among which the Arnoldi-type algorithm and the GMRES algorithm are competitive candidates. In essence, the former deals with the PageRank problem from an eigenproblem, while the latter from a linear system, point of view. However, there is little known about the relations between the two approaches for PageRank. In this article, we focus on a theoretical and numerical comparison of the two approaches. Numerical experiments illustrate the effectiveness of our theoretical results.
Funder
National Natural Science Foundation of China
National Natural Science Foundation of Jiangsu Province
Natural Science Foundation of Xuzhou Normal University
Qing-Lan Project of Jiangsu Province
Shanghai Education Committee
Science and Technology Commission of Shanghai Municipality
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Science Applications,General Business, Management and Accounting,Information Systems
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献