Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Analisis Motif Jaringan× | Analisis Rangkaian Sosial× | |
|---|---|---|
| Bidang | Analisis Rangkaian | Analisis Rangkaian |
| Keluarga≠ | Process / pipeline | Machine learning |
| Tahun asal≠ | 2002 | 1934 (sociometry); 1994 (modern formalization) |
| Pengasas≠ | — | Moreno, J.L.; formalized by Wasserman & Faust |
| Jenis≠ | Statistical pattern-detection method for directed graphs | Structural/relational analysis framework |
| Sumber perintis≠ | Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002). Network Motifs: Simple Building Blocks of Complex Networks. Science, 298(5594), 824-827. DOI ↗ | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1 |
| Alias≠ | network motifs, subgraph significance profile, Ağ Motif Analizi (Network Motifs) | SNA, network analysis, sociometric analysis, relational analysis |
| Berkaitan≠ | 3 | 5 |
| Ringkasan≠ | Network motif analysis is a statistical method for directed networks, introduced by Milo, Shen-Orr, and Alon in 2002, that identifies small recurring subgraph patterns — motifs — that appear significantly more often than would be expected in a comparable random network. By comparing a real network against a null ensemble of randomised graphs, the method reveals the elementary structural building blocks that define the functional organisation of biological regulatory networks, social networks, and other complex systems. | 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 ↗ |
|
|