Open Access
Translator Disclaimer
2013 An Adaptive Reordered Method for Computing PageRank
Yi-Ming Bu, Ting-Zhu Huang
J. Appl. Math. 2013: 1-6 (2013). DOI: 10.1155/2013/507915

Abstract

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.

Citation

Download Citation

Yi-Ming Bu. Ting-Zhu Huang. "An Adaptive Reordered Method for Computing PageRank." J. Appl. Math. 2013 1 - 6, 2013. https://doi.org/10.1155/2013/507915

Information

Published: 2013
First available in Project Euclid: 14 March 2014

zbMATH: 1311.68020
MathSciNet: MR3082133
Digital Object Identifier: 10.1155/2013/507915

Rights: Copyright © 2013 Hindawi

JOURNAL ARTICLE
6 PAGES


SHARE
Vol.2013 • 2013
Back to Top