An improved approach to the PageRank problems

DOI10.1155/2013/438987MaRDI QIDQ1789915zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Yue Xie, Ting-Zhu Huang, Chun Wen, De-An Wu

Publication date 10 October 2018

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2013/438987

Mathematics Subject Classification ID

Internet topics (68M11) Searching and sorting (68P10)

Review text

Summary: We introduce a partition of the web pages particularly suited to the PageRank problems in which the web link graph has a nested block structure. Based on the partition of the web pages, dangling nodes, common nodes, and general nodes, the hyperlink matrix can be reordered to be a more simple block structure. Then based on the parallel computation method, we propose an algorithm for the PageRank problems. In this algorithm, the dimension of the linear system becomes smaller, and the vector for general nodes in each block can be calculated separately in every iteration. Numerical experiments show that this approach speeds up the computation of PageRank.

Recommendations

• Fast PageRank Computation via a Sparse Linear System
• On accelerating the PageRank computation
• PageRank problem, survey and future research directions
• A Reordering for the PageRank Problem
• A Hessenberg-type algorithm for computing PageRank problems

Cited in

(20)

• An efficient elimination strategy for solving PageRank problems
• A Hessenberg-type algorithm for computing PageRank problems
• Non-backtracking PageRank
• An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC
• An improved PageRank algorithm based on cloud computing
• A Singular Perturbation Approach for Choosing the PageRank Damping Factor
• Extended separating plane algorithm and NSO-solutions of PageRank problem
• PageRank Computation, with Special Attention to Dangling Nodes
• PageRank problem, survey and future research directions
• How to improve the PageRank of a tree
• An adaptive reordered method for computing PageRank
• Deeper Inside PageRank
• scientific article; zbMATH DE number 2086529 (Why is no real title available?)
• Algorithms and Models for the Web-Graph
• Parallelizing the Computation of PageRank
• A Reordering for the PageRank Problem
• Fast PageRank Computation via a Sparse Linear System
• A Survey on PageRank Computing
• Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems
• Google pageranking problem: The model and the analysis

This page was built for publication: An improved approach to the PageRank problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789915)