השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| ניתוח מודולריות משוקללת× | ניתוח רשתות חברתיות משוקללות× | |
|---|---|---|
| תחום | ניתוח רשתות | ניתוח רשתות |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 2004 | 2004–2010 |
| הוגה השיטה≠ | Newman, M. E. J. | Barrat, A.; Opsahl, T. et al. |
| סוג≠ | Community structure optimization on weighted graphs | Network analysis framework |
| מקור מכונן≠ | Newman, M. E. J. (2004). Analysis of weighted networks. Physical Review E, 70(5), 056131. DOI ↗ | Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752. DOI ↗ |
| כינויים | weighted modularity, weighted Q optimization, weighted network community detection, strength-based modularity | Weighted SNA, valued network analysis, tie-strength network analysis, weighted graph analysis |
| קשורות≠ | 5 | 6 |
| תקציר≠ | Weighted modularity analysis extends the classical Newman-Girvan modularity measure to networks where edges carry numeric strengths (frequencies, intensities, costs). By replacing binary adjacency with tie weights, it finds community partitions that reflect how densely interconnected subgroups are relative to what is expected under a weighted null model, yielding more nuanced groupings than unweighted approaches on data where edge strength varies meaningfully. | Weighted Social Network Analysis extends classical SNA by assigning numeric values — weights — to ties between actors, capturing tie strength, interaction frequency, or resource flow. Rather than treating all connections as equal, it reveals who holds privileged positions by virtue of the intensity, not merely the existence, of their relationships. |
| ScholarGateמערך נתונים ↗ |
|
|