A multi-power and multi-splitting inner-outer iteration for PageRank computation-Reference-Cited by-同舟云学术

A multi-power and multi-splitting inner-outer iteration for PageRank computation

Published:2020-01-01 Issue:1 Volume:18 Page:1709-1718
ISSN:2391-5455
Container-title:Open Mathematics
language:en
Short-container-title:

Author:

Pu Bing-Yuan¹,Wen Chun²,Hu Qian-Ying²

Affiliation:

1. Department of Basic Science, Chengdu Textile College , Chengdu , 611731 , China

2. School of Mathematical Sciences, University of Electronic Science and Technology of China , Chengdu , 611731 , China

Abstract

Abstract As an effective and possible method for computing PageRank problem, the inner-outer (IO) iteration has attracted wide interest in the past few years since it was first proposed by Gleich et al. (2010). In this paper, we present a variant of the IO iteration, which is based on multi-step power and multi-step splitting and is denoted by MPMIO. The description and convergence are discussed in detail. Numerical examples are given to illustrate the effectiveness of the proposed method.

Publisher

Walter de Gruyter GmbH

Subject

General Mathematics

Link

https://www.degruyter.com/document/doi/10.1515/math-2020-0120/pdf

Reference21 articles.

1. L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank Citation Ranking: Bringing Order to the Web, Technical Report, Stanford InfoLab, 1999.

2. A. N. Langville and C. D. Meyer, Deeper inside PageRank, Internet Math. 1 (2004), no. 3, 335–380, https://doi.org/10.1080/15427951.2004.10129091.

3. A. N. Langville and C. D. Meyer, Google’s PageRank and Beyond: The Science of Search Engine Rankings, Princeton University Press, Princeton, NJ, 2012.

4. P. Berkhin, A survey on PageRank computing, Internet Math. 2 (2005), no. 1, 73–120, https://doi.org/10.1080/15427951.2005.10129098.

5. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub, Extrapolation methods for accelerating PageRank computations, in: WWW ‘03 – Proceedings of the 12th International Conference on World Wide Web, Association for Computing Machinery, New York, NY, USA, 2003, pp. 261–270.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Parameterized Multi-Splitting Iterative Method for Solving the PageRank Problem;Mathematics;2023-07-28