ScholarGate
助手
Machine learningNetwork science

定向PageRank

定向PageRank是一种基于链接的权威度评分算法,通过迭代地通过出链重新分配秩来为有向图中的节点分配重要性分数。它由Brin和Page于1998年提出,是Google搜索的基石,它不仅衡量节点有多少入链,还衡量指向它的节点的权威性。

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

阅读完整方法

仅限会员

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

登录

Method map

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

+3 more

来源

  1. Brin, S. & Page, L. (1998). The anatomy of a large-scale hypertextual Web search engine. Proceedings of the 7th International Conference on World Wide Web (WWW7), 107–117. Elsevier. link
  2. Langville, A. N. & Meyer, C. D. (2006). Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press. ISBN: 978-0-691-12202-1

如何引用本页

ScholarGate. (2026, June 3). Directed PageRank (Link-Based Authority Ranking on Directed Graphs). ScholarGate. https://scholargate.app/zh/network-analysis/directed-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

被引用于

ScholarGateDirected PageRank (Directed PageRank (Link-Based Authority Ranking on Directed Graphs)). 于 2026-06-15 检索自 https://scholargate.app/zh/network-analysis/directed-pagerank · 数据集: https://doi.org/10.5281/zenodo.20539026