Sammenlign metoder
Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.
| Vægtet egenvektorcentralitet× | Vægtet Betweenness Centrality× | |
|---|---|---|
| Fagområde | Netværksanalyse | Netværksanalyse |
| Familie | Machine learning | Machine learning |
| Oprindelsesår≠ | 1987 (binary); 2010 (weighted generalization) | 2010 |
| Ophavsperson≠ | Bonacich, P. (binary); Opsahl, T. et al. (weighted extension) | Opsahl, T.; Agneessens, F.; Skvoretz, J. (extending Freeman 1977 and Brandes 2001) |
| Type≠ | Spectral centrality measure | Centrality measure (path-based) |
| Oprindelig kilde≠ | Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. DOI ↗ | Opsahl, T., Agneessens, F., & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251. DOI ↗ |
| Aliasser | WEC, weighted spectral centrality, strength-weighted eigenvector centrality, weighted eigenvector prestige | WBC, weighted shortest-path betweenness, edge-weighted betweenness, geodesic betweenness (weighted) |
| Relaterede | 6 | 6 |
| Resumé≠ | Weighted eigenvector centrality extends the classic eigenvector centrality measure to graphs where edges carry numerical weights, scoring each node proportionally to the sum of its neighbors' scores multiplied by the connecting edge weights. Nodes score highly not just by having many connections but by being strongly linked to other influential nodes, making the measure sensitive to both tie strength and network position simultaneously. | 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. |
| ScholarGateDatasæt ↗ |
|
|