Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Centralité de proximité pondérée× | Centralité de degré pondéré× | |
|---|---|---|
| Domaine | Analyse de réseaux | Analyse de réseaux |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 2010 | 2004 |
| Auteur d'origine≠ | Opsahl, T.; Agneessens, F.; Skvoretz, J. (extending Freeman 1977 and Brandes 2001) | Barrat, A.; Barthélemy, M.; Pastor-Satorras, R.; Vespignani, A. |
| Type≠ | Centrality measure (path-based) | Centrality measure for weighted networks |
| Source fondatrice≠ | Opsahl, T., Agneessens, F., & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251. 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 | WBC, weighted shortest-path betweenness, edge-weighted betweenness, geodesic betweenness (weighted) | node strength, strength centrality, weighted node degree, WDC |
| Apparentées | 6 | 6 |
| Résumé≠ | 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. | 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. |
| ScholarGateJeu de données ↗ |
|
|