Machine learningNetwork science
加权介数中心性
加权介数中心性将弗里曼的介数度量扩展到边加权图，通过可调的边权重变换来路由最短路径。位于许多高价值最短路径上的节点会获得高分，从而识别出在连接强度很重要的社交、生物和信息网络中的中介者和桥梁。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
+1 more
来源
- Opsahl, T., Agneessens, F., & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251. DOI: 10.1016/j.socnet.2010.03.006 ↗
- Brandes, U. (2001). A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2), 163–177. DOI: 10.1080/0022250X.2001.9990249 ↗
如何引用本页
ScholarGate. (2026, June 3). Weighted Betweenness Centrality (Geodesic Path-Count on Edge-Weighted Graphs). ScholarGate. https://scholargate.app/zh/network-analysis/weighted-betweenness-centrality
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- 中间性中心度网络分析↔ compare
- 社会网络分析网络分析↔ compare
- 加权紧密度中心性网络分析↔ compare
- 加权度中心性网络分析↔ compare
- 加权特征向量中心性网络分析↔ compare
- 加权社会网络分析网络分析↔ compare