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 t...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2013/507915 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832568007803535360 |
|---|---|
| author | Yi-Ming Bu Ting-Zhu Huang |
| author_facet | Yi-Ming Bu Ting-Zhu Huang |
| author_sort | Yi-Ming Bu |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-7d7d3ff4d86148b5acc24c15b9663891 |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-7d7d3ff4d86148b5acc24c15b96638912025-02-03T00:59:59ZengWileyJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/507915507915An Adaptive Reordered Method for Computing PageRankYi-Ming Bu0Ting-Zhu Huang1School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, ChinaSchool of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, ChinaWe 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.http://dx.doi.org/10.1155/2013/507915 |
| spellingShingle | Yi-Ming Bu Ting-Zhu Huang An Adaptive Reordered Method for Computing PageRank Journal of Applied Mathematics |
| title | An Adaptive Reordered Method for Computing PageRank |
| title_full | An Adaptive Reordered Method for Computing PageRank |
| title_fullStr | An Adaptive Reordered Method for Computing PageRank |
| title_full_unstemmed | An Adaptive Reordered Method for Computing PageRank |
| title_short | An Adaptive Reordered Method for Computing PageRank |
| title_sort | adaptive reordered method for computing pagerank |
| url | http://dx.doi.org/10.1155/2013/507915 |
| work_keys_str_mv | AT yimingbu anadaptivereorderedmethodforcomputingpagerank AT tingzhuhuang anadaptivereorderedmethodforcomputingpagerank AT yimingbu adaptivereorderedmethodforcomputingpagerank AT tingzhuhuang adaptivereorderedmethodforcomputingpagerank |