ScholarGate
助手
Machine learningNetwork science

贝叶斯PageRank

贝叶斯PageRank将经典的PageRank算法嵌入到一个贝叶斯概率框架中进行扩展。它不为每个节点返回一个单一的确定性排名分数,而是量化排名估计中的不确定性——这在网络不完整、有噪声或存在观测误差时尤其有价值。它用于网络分析、引文网络和社会网络研究,这些领域中排名不确定性很重要。

在 MethodMind 中打开即将推出视频即将推出Download slides

阅读完整方法

仅限会员

使用免费账户登录即可阅读本节。

登录

Method map

The neighbourhood of related methods — select a node to explore.

来源

  1. Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The PageRank citation ranking: Bringing order to the web. Stanford InfoLab Technical Report. link
  2. PageRank. Wikipedia. link

如何引用本页

ScholarGate. (2026, June 3). Bayesian PageRank (Probabilistic Ranking on Networks). ScholarGate. https://scholargate.app/zh/network-analysis/bayesian-pagerank

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side
ScholarGateBayesian PageRank (Bayesian PageRank (Probabilistic Ranking on Networks)). 于 2026-06-15 检索自 https://scholargate.app/zh/network-analysis/bayesian-pagerank · 数据集: https://doi.org/10.5281/zenodo.20539026