Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Analiza rețelelor sociale ponderate× | Centralitatea de intermediere× | |
|---|---|---|
| Domeniu | Analiza rețelelor | Analiza rețelelor |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2004–2010 | 1977 |
| Autorul original≠ | Barrat, A.; Opsahl, T. et al. | Freeman, L. C. |
| Tip≠ | Network analysis framework | Centrality measure |
| Sursa seminală≠ | 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 ↗ |
| Denumiri alternative | Weighted SNA, valued network analysis, tie-strength network analysis, weighted graph analysis | Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness |
| Înrudite | 6 | 6 |
| Rezumat≠ | Weighted Social Network Analysis extends classical SNA by assigning numeric values — weights — to ties between actors, capturing tie strength, interaction frequency, or resource flow. Rather than treating all connections as equal, it reveals who holds privileged positions by virtue of the intensity, not merely the existence, of their relationships. | 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. |
| ScholarGateSet de date ↗ |
|
|