Sammenlign metoder
Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.
| Vektet gradsentralitet× | Betweenness Centrality× | |
|---|---|---|
| Fagfelt | Nettverksanalyse | Nettverksanalyse |
| Familie | Machine learning | Machine learning |
| Opprinnelsesår≠ | 2004 | 1977 |
| Opphavsperson≠ | Barrat, A.; Barthélemy, M.; Pastor-Satorras, R.; Vespignani, A. | Freeman, L. C. |
| Type≠ | Centrality measure for weighted networks | Centrality measure |
| Opprinnelig kilde≠ | 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 ↗ | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ |
| Alias | node strength, strength centrality, weighted node degree, WDC | Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness |
| Relaterte | 6 | 6 |
| Sammendrag≠ | 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. | Betweenness centrality, formalized by Linton C. Freeman in 1977, measures how often a node lies on the shortest path connecting every other pair of nodes in a network. High-betweenness nodes act as bridges or brokers: removing them fragments the network into disconnected components more severely than removing any other nodes. |
| ScholarGateDatasett ↗ |
|
|