השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| ניתוח רשתות חברתיות משוקללות× | מרכזיות ביניים (Betweenness Centrality)× | |
|---|---|---|
| תחום | ניתוח רשתות | ניתוח רשתות |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 2004–2010 | 1977 |
| הוגה השיטה≠ | Barrat, A.; Opsahl, T. et al. | Freeman, L. C. |
| סוג≠ | Network analysis framework | Centrality measure |
| מקור מכונן≠ | 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 ↗ | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ |
| כינויים | Weighted SNA, valued network analysis, tie-strength network analysis, weighted graph analysis | Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness |
| קשורות | 6 | 6 |
| תקציר≠ | 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. | Betweenness centrality, formalized by Linton C. Freeman in 1977, measures how often a node lies on the shortest path connecting every other pair of nodes in a network. High-betweenness nodes act as bridges or brokers: removing them fragments the network into disconnected components more severely than removing any other nodes. |
| ScholarGateמערך נתונים ↗ |
|
|