An adaptive reordered method for computing PageRank
From MaRDI portal
Publication:364413
DOI10.1155/2013/507915zbMATH Open1311.68020OpenAlexW2068585810WikidataQ59002704 ScholiaQ59002704MaRDI QIDQ364413FDOQ364413
Authors: Yi-Ming Bu, Ting-Zhu Huang
Publication date: 9 September 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/507915
Recommendations
- Adaptive methods for the computation of PageRank
- An adaptive Power-GArnoldi algorithm for computing PageRank
- A Reordering for the PageRank Problem
- An adaptive improvement on PageRank algorithm
- On adaptively accelerated Arnoldi method for computing PageRank.
- Several relaxed iteration methods for computing PageRank
- scientific article; zbMATH DE number 2086529
- An improved approach to the PageRank problems
- Acceleration of an adaptive generalized Arnoldi method for computing PageRank
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Stochastic matrices (15B51) Internet topics (68M11)
Cites Work
- Adaptive methods for the computation of PageRank
- On computing PageRank via lumping the Google matrix
- A Power–Arnoldi algorithm for computing PageRank
- An Arnoldi-extrapolation algorithm for computing pagerank
- A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining
- A Reordering for the PageRank Problem
Cited In (2)
This page was built for publication: An adaptive reordered method for computing PageRank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364413)