方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 贝叶斯介数中心性× | 加权介数中心性× | |
|---|---|---|
| 领域 | 网络分析 | 网络分析 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2010s | 2010 |
| 提出者≠ | Brandes, U. (betweenness); Bayesian extension developed by multiple authors (2010s) | Opsahl, T.; Agneessens, F.; Skvoretz, J. (extending Freeman 1977 and Brandes 2001) |
| 类型≠ | Probabilistic network centrality measure | Centrality measure (path-based) |
| 开创性文献≠ | Newman, M.E.J. (2010). Networks: An Introduction. Oxford University Press. ISBN: 978-0-19-920665-0 | Opsahl, T., Agneessens, F., & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251. DOI ↗ |
| 别名 | Bayesian BC, probabilistic betweenness centrality, uncertainty-aware betweenness centrality, posterior betweenness estimation | WBC, weighted shortest-path betweenness, edge-weighted betweenness, geodesic betweenness (weighted) |
| 相关≠ | 3 | 6 |
| 摘要≠ | Bayesian Betweenness Centrality estimates how often a node lies on shortest paths in a network while explicitly quantifying uncertainty arising from incomplete, sampled, or noisy edge observations. Rather than producing a single point estimate, it yields a posterior distribution over betweenness scores, enabling credible intervals and probabilistic comparisons between nodes. | 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. |
| ScholarGate数据集 ↗ |
|
|