PageRank Computation, with Special Attention to Dangling Nodes

From MaRDI portal
Publication:3537449

DOI10.1137/060664331zbMath1156.65038OpenAlexW1985129090MaRDI QIDQ3537449

Ilse C. F. Ipsen, Teresa M. Selee

Publication date: 6 November 2008

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/88391d7c1cf1d1f2f5e9d35324aa0ef957b0c051




Related Items

Acceleration of the generalized FOM algorithm for computing PageRankA simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRankAccelerating the Arnoldi method via Chebyshev polynomials for computing PageRankAn Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRankPredicting adolescent social networks to stop smoking in secondary schoolsAccelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problemMulti-linear pseudo-PageRank for hypergraph partitioningOn computing HITS ExpertRank via lumping the hub matrixConvergence of multi-level iterative aggregation-disaggregation methodsThe extrapolation-accelerated multilevel aggregation method in PageRank computationA two-step matrix splitting iteration for computing PageRankPhysiology and pathology of iterative aggregation–disaggregation methodsA note on certain ergodicity coefficientsPageRank computation with MAAOR and lumping methodsRational extrapolation for the PageRank vectorAn Arnoldi-extrapolation algorithm for computing pagerankA note on the two-step matrix splitting iteration for computing PageRankThe PageRank model of minimal irreducible adjustment and its lumping methodOn the multi-splitting iteration method for computing PageRankOn computing PageRank via lumping the Google matrixA general multi-splitting iteration method for computing PageRankAn extrapolation iteration and its lumped type iteration for computing PageRank