A multi-power and multi-splitting inner-outer iteration for PageRank computation
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 mu...
Main Authors: | Pu Bing-Yuan, Wen Chun, Hu Qian-Ying |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2020-12-01
|
Series: | Open Mathematics |
Subjects: | |
Online Access: | https://doi.org/10.1515/math-2020-0120 |
Similar Items
-
A Parameterized Multi-Splitting Iterative Method for Solving the PageRank Problem
by: Yajun Xie, et al.
Published: (2023-07-01) -
The general tensor regular splitting iterative method for multilinear PageRank problem
by: Shuting Tang, et al.
Published: (2024-01-01) -
Extending the Adapted PageRank Algorithm Centrality to Multiplex Networks with Data Using the PageRank Two-Layer Approach
by: Taras Agryzkov, et al.
Published: (2019-02-01) -
Distributed Algorithms on Exact Personalized PageRank
by: Guo, Tao, et al.
Published: (2017) -
Toward Efficient Hub-Less Real Time Personalized PageRank
by: Matin Pirouz, et al.
Published: (2017-01-01)