方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 有向介数中心性× | 中间性中心度× | |
|---|---|---|
| 领域 | 网络分析 | 网络分析 |
| 方法族 | Machine learning | Machine learning |
| 起源年份 | 1977 | 1977 |
| 提出者 | Freeman, L. C. | Freeman, L. C. |
| 类型≠ | Centrality measure (directed graph) | Centrality measure |
| 开创性文献 | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ |
| 别名 | directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness | Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness |
| 相关≠ | 5 | 6 |
| 摘要≠ | Directed Betweenness Centrality extends Freeman's classic betweenness measure to directed graphs, quantifying how often a node lies on the shortest directed paths between all other pairs of nodes. It identifies gatekeepers, brokers, and bottlenecks in asymmetric flows such as information cascades, citation networks, and organizational hierarchies. | Betweenness centrality, formalized by Linton C. Freeman in 1977, measures how often a node lies on the shortest path connecting every other pair of nodes in a network. High-betweenness nodes act as bridges or brokers: removing them fragments the network into disconnected components more severely than removing any other nodes. |
| ScholarGate数据集 ↗ |
|
|