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: | Yi-Ming Bu, Ting-Zhu Huang |
---|---|
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!
|
Similar Items
-
Monte Carlo Based Personalized PageRank on Dynamic Networks
by: Zhang Junchao, et al.
Published: (2013-09-01) -
Application of Modified PageRank Algorithm for Anomaly Detection in Movements of Older Adults
by: Shahram Payandeh, et al.
Published: (2019-01-01) -
Importance Analysis of Causative Nodes for Accident Chains of Railway Locomotive Operation Based on STPA-PageRank Method
by: Ping WAN, et al.
Published: (2025-02-01) -
Radial Basis Point Interpolation Method with Reordering Gauss Domains for 2D Plane Problems
by: Shi-Chao Yi, et al.
Published: (2014-01-01) -
Packet Reordering Metrics to Enable Performance Comparison in IP-Networks
by: Pedro Rodrigues Torres-Jr, et al.
Published: (2020-01-01)