Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Analisis Jaringan Sosial Berbobot× | Pusat Darjah× | |
|---|---|---|
| Bidang | Analisis Rangkaian | Analisis Rangkaian |
| Keluarga | Machine learning | Machine learning |
| Tahun asal≠ | 2004–2010 | 1978 |
| Pengasas≠ | Barrat, A.; Opsahl, T. et al. | Freeman, L. C. |
| Jenis≠ | Network analysis framework | Node-level centrality measure |
| Sumber perintis≠ | 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. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| Alias | Weighted SNA, valued network analysis, tie-strength network analysis, weighted graph analysis | node degree, degree score, DC, connectivity centrality |
| Berkaitan | 6 | 6 |
| Ringkasan≠ | 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. | Degree centrality is the simplest and most intuitive measure of a node's importance in a network, defined as the number of direct ties a node has to other nodes. Normalized by dividing by the maximum possible ties, it allows comparison across networks of different sizes and is the starting point of almost every network analysis. |
| ScholarGateSet data ↗ |
|
|