Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Dynamisk gradcentralitet× | Viktad gradcentralitet× | |
|---|---|---|
| Ämnesområde | Nätverksanalys | Nätverksanalys |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2012 | 2004 |
| Upphovsperson≠ | Holme, P. & Saramaki, J.; Kim, H. & Anderson, R. | Barrat, A.; Barthélemy, M.; Pastor-Satorras, R.; Vespignani, A. |
| Typ≠ | Centrality measure (temporal extension) | Centrality measure for weighted networks |
| Ursprungskälla≠ | 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 ↗ |
| Alias | time-varying degree centrality, temporal degree centrality, evolving degree centrality, DDC | node strength, strength centrality, weighted node degree, WDC |
| Närliggande≠ | 5 | 6 |
| Sammanfattning≠ | 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. |
| ScholarGateDatamängd ↗ |
|
|