Journal of Applied Mathematics
- J. Appl. Math.
- Volume 2013 (2013), Article ID 507915, 6 pages.
An Adaptive Reordered Method for Computing PageRank
We propose an adaptive reordered method to deal with the PageRank problem. It has been shown that one can reorder the hyperlink matrix of PageRank problem to calculate a reduced system and get the full PageRank vector through forward substitutions. This method can provide a speedup for calculating the PageRank vector. We observe that in the existing reordered method, the cost of the recursively reordering procedure could offset the computational reduction brought by minimizing the dimension of linear system. With this observation, we introduce an adaptive reordered method to accelerate the total calculation, in which we terminate the reordering procedure appropriately instead of reordering to the end. Numerical experiments show the effectiveness of this adaptive reordered method.
J. Appl. Math., Volume 2013 (2013), Article ID 507915, 6 pages.
First available in Project Euclid: 14 March 2014
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Bu, Yi-Ming; Huang, Ting-Zhu. An Adaptive Reordered Method for Computing PageRank. J. Appl. Math. 2013 (2013), Article ID 507915, 6 pages. doi:10.1155/2013/507915. https://projecteuclid.org/euclid.jam/1394808074