방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 시간적 근접 중심성× | 시간적 사회 연결망 분석× | |
|---|---|---|
| 분야 | 네트워크 분석 | 네트워크 분석 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2011 | 2000s–2010s |
| 창시자≠ | Pan, R. K. & Saramaki, J. | Moody, J.; Holme, P.; Saramäki, J. |
| 유형≠ | Centrality measure (temporal) | Longitudinal network analysis |
| 원전≠ | Pan, R. K., & Saramaki, J. (2011). Path lengths, correlations, and centrality in temporal networks. Physical Review E, 84(1), 016105. DOI ↗ | Holme, P., & Saramäki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ |
| 별칭 | time-varying closeness centrality, dynamic closeness centrality, TCC, temporal reachability-based centrality | TSNA, longitudinal social network analysis, time-varying network analysis, dynamic SNA |
| 관련≠ | 6 | 4 |
| 요약≠ | Temporal closeness centrality extends the classical closeness measure to time-varying networks by replacing static shortest paths with time-respecting (foremost) paths. It quantifies how quickly a node can reach all other nodes when interactions occur at specific moments in time, giving a more realistic picture of information flow, disease spread, and influence in dynamic systems. | Temporal Social Network Analysis (TSNA) extends classic social network analysis by treating networks as time-varying structures. Rather than aggregating all ties into a single static snapshot, TSNA tracks when ties form, persist, and dissolve, enabling researchers to study how social structures evolve and how dynamic connectivity shapes diffusion, influence, and inequality over time. |
| ScholarGate데이터셋 ↗ |
|
|