방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 동적 근접 중심성× | 근접 중심성× | |
|---|---|---|
| 분야 | 네트워크 분석 | 네트워크 분석 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2010–2012 | 1950 (formalized 1979) |
| 창시자≠ | Tang, J. et al.; Holme, P. & Saramäki, J. | Bavelas, A.; formalized by Freeman, L. C. |
| 유형≠ | Centrality measure for temporal networks | Node-level centrality index |
| 원전≠ | Tang, J., Musolesi, M., Mascolo, C., Latora, V. & Nicosia, V. (2010). Analysing information flows and key mediators through temporal centrality metrics. Proceedings of the 3rd Workshop on Social Network Systems (SNS '10). ACM. DOI ↗ | Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| 별칭 | temporal closeness centrality, time-varying closeness centrality, evolving network closeness, dynamic CC | closeness, farness-based centrality, geodesic closeness, normalized closeness centrality |
| 관련≠ | 5 | 6 |
| 요약≠ | Dynamic closeness centrality extends classic closeness centrality to temporal networks by computing shortest time-respecting paths — paths that traverse edges in chronological order — and averaging inverse distances across all time windows. It reveals which nodes are most efficiently reached within an evolving network, tracking how a node's centrality rises and falls as connections appear and disappear over time. | 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. |
| ScholarGate데이터셋 ↗ |
|
|