ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

定向PageRank×定向社交网络分析×
领域网络分析网络分析
方法族Machine learningMachine learning
起源年份19981994
提出者Brin, S. & Page, L.Wasserman, S. & Faust, K.
类型Iterative authority-scoring algorithmStructural analysis of directed graphs
开创性文献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 ↗Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1
别名PageRank, PR, Google PageRank, directed link analysisdirected SNA, digraph analysis, directed graph network analysis, asymmetric network analysis
相关55
摘要Directed PageRank is a link-based authority scoring algorithm that assigns importance scores to nodes in a directed graph by iteratively redistributing rank through outgoing edges. Introduced by Brin and Page in 1998 as the backbone of Google Search, it measures not just how many in-links a node has but how authoritative the nodes pointing to it are.Directed Social Network Analysis (directed SNA) studies networks in which every tie has an explicit direction — from a sender to a receiver — rather than treating relationships as symmetric. It extends the classical SNA toolkit with in-degree, out-degree, reciprocity, and asymmetric path measures, making it the appropriate framework wherever relationship direction carries substantive meaning, such as citation flows, advice-seeking, follower graphs, or information cascades.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Directed PageRank · Directed Social Network Analysis. 于 2026-06-18 检索自 https://scholargate.app/zh/compare