[1]李兰英,周秋丽,孔银,等.子图估算PageRank网页排序算法研究[J].哈尔滨理工大学学报,2017,(02):117-123.[doi:10.15938/j.jhust.2017.02.022]
 LI Lau-uR-,ZHOUiu-Li,KONG YinDONG Yi-miuR-.Research of Subgraph Estimation Page RankAlgorithm for Web Page Rank[J].哈尔滨理工大学学报,2017,(02):117-123.[doi:10.15938/j.jhust.2017.02.022]
点击复制

子图估算PageRank网页排序算法研究()
分享到:

《哈尔滨理工大学学报》[ISSN:1007-2683/CN:23-1404/N]

卷:
期数:
2017年02期
页码:
117-123
栏目:
计算机与控制工程
出版日期:
2017-04-25

文章信息/Info

Title:
Research of Subgraph Estimation Page Rank Algorithm for Web Page Rank
文章编号:
1007-2683(2017)02-0117-07
作者:
李兰英周秋丽孔银董义明
(哈尔滨理工大学计算机科学与技术学院,黑龙江哈尔滨isooso>
Author(s):
LI Lau-协uR-ZHOU口iu-LiKONG Yin DONG Yi-miuR-
( School of Computer Science and ’fechnolo}y 日arhin I」 nicersitv of Seienee and ’feclmolo}y, llarbin 150080,China)
关键词:
关键词:WPh图数据网页排序PageRank算法MapReduce子图
Keywords:
Keywords:web datawebpage schedulingPageRank algorithmMapReducesubgraphs
DOI:
10.15938/j.jhust.2017.02.022
文献标志码:
A
摘要:
摘要:针对传统PageRank算法难以高效处理Web图数据网页排序问题,文章在不栖牲准确 度的前提下,提出一种在MapReduce平台上基于改进PageRank的加速算法:topK-Rank.为识别出 排名为前k的网页,通过在迭代过程中裁剪掉不必要的节点及边的形式,动态构建子图,由子图迭 代计算出PageRank值的上下限。理论分析和实验结果表明:该算法不仅可以保证结果的准确性, 还可以更快地找到用户所需网页数
Abstract:
Abstract:The traditional PageRank algorithm can not efficiently perform large data Webpage scheduling problem. This paper proposes an accelerated algorithm named topK-Rank,which is based on PageRank on the MapReduce platform. It can find top k nodes efficiently for a given graph without sacrificing accuracy. In order to identify top k nodes,topK-Rank algorithm prunes unnecessary nodes and edges in each iteration to dynamically construct subgraphs,and iteratively estimates lower/upper bounds of PageRank scores through subgraphs. Theoretical analysis shows that this method guarantees result exactness. Experiments show that topK-Rank algorithm can find k nodes much faster than the existing approaches.

备注/Memo

备注/Memo:
收稿日期:2015 -09一14 基金项目:黑龙江省教育厅利一学技术研究项目(12531107). 作者简介:李兰英(1964-),女,硕士,教授,L,-mail; lu1u08521 @ sing 周秋丽(1988-),女,硕士研究生; 孔银(1990-) ,男,硕士研究生.
更新日期/Last Update: 2017-06-13