方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 加权介数中心性× | 加权紧密度中心性× | |
|---|---|---|
| 领域 | 网络分析 | 网络分析 |
| 方法族 | Machine learning | Machine learning |
| 起源年份 | 2010 | 2010 |
| 提出者≠ | Opsahl, T.; Agneessens, F.; Skvoretz, J. (extending Freeman 1977 and Brandes 2001) | Opsahl, T.; Agneessens, F.; Skvoretz, J. |
| 类型≠ | Centrality measure (path-based) | Centrality measure (network analysis) |
| 开创性文献≠ | Opsahl, T., Agneessens, F., & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251. DOI ↗ | Opsahl, T., Agneessens, F. & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251. DOI ↗ |
| 别名 | WBC, weighted shortest-path betweenness, edge-weighted betweenness, geodesic betweenness (weighted) | weighted closeness, generalized closeness centrality, WCC, distance-weighted closeness |
| 相关 | 6 | 6 |
| 摘要≠ | Weighted Betweenness Centrality extends Freeman's betweenness measure to edge-weighted graphs by routing shortest paths through a tunable transformation of edge weights. Nodes that sit on many high-value shortest paths receive high scores, identifying brokers and bridges in social, biological, and information networks where tie strength matters. | Weighted closeness centrality extends the classic closeness measure to networks where edges carry numerical weights — such as frequency, strength, or cost — by incorporating those weights into shortest-path distances. Nodes that can reach others quickly along strong or efficient connections receive higher scores, making it a richer indicator of information-spreading potential than its binary counterpart. |
| ScholarGate数据集 ↗ |
|
|