Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Центральність за близькістю× | Центральність за ступенем× | |
|---|---|---|
| Галузь | Мережевий аналіз | Мережевий аналіз |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1950 (formalized 1979) | 1978 |
| Автор методу≠ | Bavelas, A.; formalized by Freeman, L. C. | Freeman, L. C. |
| Тип≠ | Node-level centrality index | Node-level centrality measure |
| Основоположне джерело≠ | Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ | Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| Інші назви | closeness, farness-based centrality, geodesic closeness, normalized closeness centrality | node degree, degree score, DC, connectivity centrality |
| Пов'язані | 6 | 6 |
| Підсумок≠ | 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. | 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. |
| ScholarGateНабір даних ↗ |
|
|