Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Gradscentralitet× | Närhetscentralitet× | |
|---|---|---|
| Ämnesområde | Nätverksanalys | Nätverksanalys |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1978 | 1950 (formalized 1979) |
| Upphovsperson≠ | Freeman, L. C. | Bavelas, A.; formalized by Freeman, L. C. |
| Typ≠ | Node-level centrality measure | Node-level centrality index |
| Ursprungskälla≠ | Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ | Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| Alias | node degree, degree score, DC, connectivity centrality | closeness, farness-based centrality, geodesic closeness, normalized closeness centrality |
| Närliggande | 6 | 6 |
| Sammanfattning≠ | Degree centrality is the simplest and most intuitive measure of a node's importance in a network, defined as the number of direct ties a node has to other nodes. Normalized by dividing by the maximum possible ties, it allows comparison across networks of different sizes and is the starting point of almost every network analysis. | Closeness centrality measures how quickly a node can reach all others in a network by computing the inverse of its average shortest-path distance to every other node. First described by Bavelas (1950) and formally unified by Freeman (1979), it identifies nodes that can spread information or resources efficiently across the entire graph — not merely nodes with many direct contacts. |
| ScholarGateDatamängd ↗ |
|
|