원문정보
보안공학연구지원센터(IJSIA)
International Journal of Security and Its Applications
Vol.9 No.11
2015.11
pp.231-248
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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
저자정보
참고문헌
자료제공 : 네이버학술정보