方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 加权社会网络分析× | 度中心性× | |
|---|---|---|
| 领域 | 网络分析 | 网络分析 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2004–2010 | 1978 |
| 提出者≠ | Barrat, A.; Opsahl, T. et al. | Freeman, L. C. |
| 类型≠ | Network analysis framework | Node-level 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. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| 别名 | Weighted SNA, valued network analysis, tie-strength network analysis, weighted graph analysis | node degree, degree score, DC, connectivity centrality |
| 相关 | 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. | 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. |
| ScholarGate数据集 ↗ |
|
|