...
首页> 外文期刊>Automatic Control, IEEE Transactions on >Distributed Randomized PageRank Algorithm Based on Stochastic Approximation
【24h】

Distributed Randomized PageRank Algorithm Based on Stochastic Approximation

机译:基于随机逼近的分布式随机PageRank算法

获取原文
获取原文并翻译 | 示例
           

摘要

A distributed randomized PageRank algorithm based on stochastic approximation (SA) is proposed to estimate the importance scores of web pages. Compared with the existing methods, the algorithm given here has wider applications in the sense that it can deal with a larger class of randomizations. The strong consistency of the estimates is proved, and the robustness of the PageRank value is analyzed as well. Numerical examples are given to verify the obtained theoretic results.
机译:提出了一种基于随机逼近的分布式随机PageRank算法来估计网页的重要性分数。与现有方法相比,此处给出的算法可以处理更多类别的随机化,因此具有更广泛的应用。证明了估计的强一致性,并且还分析了PageRank值的鲁棒性。数值例子验证了所获得的理论结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号