השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| ניתוח רשתות חברתיות× | ניתוח מודולריות× | |
|---|---|---|
| תחום | ניתוח רשתות | ניתוח רשתות |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 1934 (sociometry); 1994 (modern formalization) | 2004 |
| הוגה השיטה≠ | Moreno, J.L.; formalized by Wasserman & Faust | Newman, M. E. J. & Girvan, M. |
| סוג≠ | Structural/relational analysis framework | Community detection / graph partitioning |
| מקור מכונן≠ | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1 | Newman, M. E. J., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113. DOI ↗ |
| כינויים | SNA, network analysis, sociometric analysis, relational analysis | Q-modularity, community structure detection, network modularity optimization, graph partitioning by modularity |
| קשורות | 5 | 5 |
| תקציר≠ | 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. | Modularity analysis is a network science method, formalized by Newman and Girvan in 2004, that detects community structure in graphs by measuring whether edges are more concentrated within groups than expected by chance. Its scalar quality index Q guides algorithms that partition nodes into cohesive clusters, making it the most widely adopted framework for community detection in social, biological, and technological networks. |
| ScholarGateמערך נתונים ↗ |
|
|