首页 | 本学科首页   官方微博 | 高级检索  
     检索      

带权网络的个性化PageRank计算
引用本文:彭茂,张媛.带权网络的个性化PageRank计算[J].南京气象学院学报,2016,8(2):116-122.
作者姓名:彭茂  张媛
作者单位:南京信息工程大学 数学与统计学院, 南京, 210044;南京信息工程大学 数学与统计学院, 南京, 210044
基金项目:国家自然科学基金(11401317);南京信息工程大学科研基金 (2012X021)
摘    要:PageRank是衡量网络节点重要性的指标之一,个性化PageRank是普通PageRank的推广形式.目前关于(个性化)PageRank的研究主要集中在无权网络,而关于带权网络的研究结果较少.有鉴于此,基于矩阵变换和蒙特卡罗方法,分别给出了在静态和动态带权网络中个性化PageRank计算方法,并从理论上分析了算法的性能.实验结果显示,两种算法都优于传统的幂迭代算法.

关 键 词:PageRank算法  蒙特卡罗方法  幂迭代法
收稿时间:2014/12/27 0:00:00

Computing personalized PageRank in weighted networks
PENG Mao and ZHANG Yuan.Computing personalized PageRank in weighted networks[J].Journal of Nanjing Institute of Meteorology,2016,8(2):116-122.
Authors:PENG Mao and ZHANG Yuan
Institution:School of Mathematics & Statistics, Nanjing University of Information Science & Technology, Nanjing 210044;School of Mathematics & Statistics, Nanjing University of Information Science & Technology, Nanjing 210044
Abstract:PageRank assigns authority weights to each web page based on the web hyperlink structure,while the personalized PageRank is a generalized version of ordinary PageRank.The computation of personalized PageRank vector in unweighted web is well studied in the past decades,but little is known for the case of weighted webs.In this paper,we analyze the algorithms for PageRank computations in static as well as dynamic weighted networks.The algorithms are based on matrix transformation or Monte Carlo methods,and are analyzed theoretically for computation performance.Experiments show that the proposed localized algorithm outperforms power iteration and a referenced Monte Carlo method.
Keywords:PageRank algorithm  Monte Carlo method  power iteration
点击此处可从《南京气象学院学报》浏览原始摘要信息
点击此处可从《南京气象学院学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号