Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Sentraliti Kehampiran Temporal× | Analisis Jaringan Sosial Temporal× | |
|---|---|---|
| Bidang | Analisis Rangkaian | Analisis Rangkaian |
| Keluarga | Machine learning | Machine learning |
| Tahun asal≠ | 2011 | 2000s–2010s |
| Pengasas≠ | Pan, R. K. & Saramaki, J. | Moody, J.; Holme, P.; Saramäki, J. |
| Jenis≠ | Centrality measure (temporal) | Longitudinal network analysis |
| Sumber perintis≠ | 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 ↗ |
| Alias | time-varying closeness centrality, dynamic closeness centrality, TCC, temporal reachability-based centrality | TSNA, longitudinal social network analysis, time-varying network analysis, dynamic SNA |
| Berkaitan≠ | 6 | 4 |
| Ringkasan≠ | 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. |
| ScholarGateSet data ↗ |
|
|