Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Analisis Jaringan Sosial Berarah× | Analisis Rangkaian Sosial× | |
|---|---|---|
| Bidang | Analisis Rangkaian | Analisis Rangkaian |
| Keluarga | Machine learning | Machine learning |
| Tahun asal≠ | 1994 | 1934 (sociometry); 1994 (modern formalization) |
| Pengasas≠ | Wasserman, S. & Faust, K. | Moreno, J.L.; formalized by Wasserman & Faust |
| Jenis≠ | Structural analysis of directed graphs | Structural/relational analysis framework |
| Sumber perintis | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1 | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1 |
| Alias | directed SNA, digraph analysis, directed graph network analysis, asymmetric network analysis | SNA, network analysis, sociometric analysis, relational analysis |
| Berkaitan | 5 | 5 |
| Ringkasan≠ | Directed Social Network Analysis (directed SNA) studies networks in which every tie has an explicit direction — from a sender to a receiver — rather than treating relationships as symmetric. It extends the classical SNA toolkit with in-degree, out-degree, reciprocity, and asymmetric path measures, making it the appropriate framework wherever relationship direction carries substantive meaning, such as citation flows, advice-seeking, follower graphs, or information cascades. | Social Network Analysis (SNA) is a structural method that maps and measures relationships and flows between people, groups, organizations, or other entities modeled as nodes connected by ties (edges). Rather than focusing on individual attributes, SNA reveals how the pattern of connections shapes behavior, influence, information flow, and outcomes within a system. |
| ScholarGateSet data ↗ |
|
|