方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 动态度中心性× | 加权度中心性× | |
|---|---|---|
| 领域 | 网络分析 | 网络分析 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2012 | 2004 |
| 提出者≠ | Holme, P. & Saramaki, J.; Kim, H. & Anderson, R. | Barrat, A.; Barthélemy, M.; Pastor-Satorras, R.; Vespignani, A. |
| 类型≠ | Centrality measure (temporal extension) | Centrality measure for weighted networks |
| 开创性文献≠ | Holme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ | Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752. DOI ↗ |
| 别名 | time-varying degree centrality, temporal degree centrality, evolving degree centrality, DDC | node strength, strength centrality, weighted node degree, WDC |
| 相关≠ | 5 | 6 |
| 摘要≠ | Dynamic degree centrality extends the classical degree centrality measure to networks that change over time. Rather than counting a node's connections in a single static snapshot, it tracks how many contacts each node maintains across successive time windows or contact events, producing a time-resolved importance profile for every actor in the network. | Weighted degree centrality — also called node strength — extends the classic degree centrality measure to networks whose edges carry numeric weights. Instead of simply counting a node's connections, it sums the weights of all edges incident to that node, capturing both the volume and the intensity of a node's ties in a single, interpretable score. |
| ScholarGate数据集 ↗ |
|
|