Earticle

초록

영어

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.

목차

Abstract
 1. Introduction
 2. PageRank
  2.1. The Description of PageRank
  2.2. Parallel Implementation of PageRank
 3. TopK-Rank
  3.1. A Full Description of TopK-Rank Algorithm
  3.2. The MapReduce Implementation of TopK-Rank
  3.3. The Time Complexity of the Algorithm
 4. Experiment and Result Analysis
  4.1. Experimental Platform and Data
  4.2. Experiment and Result Analysis
 5. Conclusion
 References

키워드

저자

• Lanying Li [ The college of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China ]
• Qiuli Zhou [ The college of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China ]
• Yin Kong [ The college of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China ]
• Yiming Dong [ The college of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605