方法证据记录
Directed Closeness Centrality
Directed closeness centrality extends the classical closeness measure to directed networks by separately quantifying how quickly a node can be reached by others (in-closeness) and how quickly it can reach all others (out-closeness). It is a foundational node-level metric in social network analysis and graph theory, used wherever link direction conveys meaningful asymmetry such as citation flows, information cascades, or authority hierarchies.
源记录
引文逐字复制自方法源记录。这些引文不代表任何层级的验证。
Directed Closeness Centrality (In-closeness and Out-closeness on Directed Graphs)
分类方法记录 · ml-model / network-analysis
- Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. · ISBN 978-0-521-38269-4
- Freeman, L. C. (1979). Centrality in social networks conceptual clarification. Social Networks, 1(3), 215–239. · DOI 10.1016/0378-8733(78)90021-7
精选声明
声明已持久化到证据分类账中，每个声明都有自己的评估。
尚无精选声明
当分类账中没有声明时，此视图不会自行创建声明评估。
相关方法
从方法图中生成，显示为机器建议的关系 — 不推断任何证据声明。