Improved Subgraph estimation PageRank Algorithm for Web Page Rank
Lanying Li, Qiuli Zhou, Yin Kong, Yiming Dong · International Journal of Security and Its Applications · 2015
The traditional PageRank algorithm can't efficiently dispose large data Webpage scheduling problem.This paper proposes an accelerated algorithm named topK-Rank .It is based on PageRank on the MapReduce platform.Owing to this algorithm ,Top k nodes can be found efficiently for a given graph without sacrificing accuracy.It can iteratively estimate lower/upper bounds of PageRank scores, and construct subgraphs in each iteration by pruning unnecessary nodes and edges.Theoretical analysis shows that this method guarantees result exactness.Experiments show that it can find top k nodes much faster than the existing approaches.