方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 加权特征向量中心性× | 加权度中心性× | |
|---|---|---|
| 领域 | 网络分析 | 网络分析 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1987 (binary); 2010 (weighted generalization) | 2004 |
| 提出者≠ | Bonacich, P. (binary); Opsahl, T. et al. (weighted extension) | Barrat, A.; Barthélemy, M.; Pastor-Satorras, R.; Vespignani, A. |
| 类型≠ | Spectral centrality measure | Centrality measure for weighted networks |
| 开创性文献≠ | Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. 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 ↗ |
| 别名 | WEC, weighted spectral centrality, strength-weighted eigenvector centrality, weighted eigenvector prestige | node strength, strength centrality, weighted node degree, WDC |
| 相关 | 6 | 6 |
| 摘要≠ | Weighted eigenvector centrality extends the classic eigenvector centrality measure to graphs where edges carry numerical weights, scoring each node proportionally to the sum of its neighbors' scores multiplied by the connecting edge weights. Nodes score highly not just by having many connections but by being strongly linked to other influential nodes, making the measure sensitive to both tie strength and network position simultaneously. | Weighted degree centrality — also called node strength — extends the classic degree centrality measure to networks whose edges carry numeric weights. Instead of simply counting a node's connections, it sums the weights of all edges incident to that node, capturing both the volume and the intensity of a node's ties in a single, interpretable score. |
| ScholarGate数据集 ↗ |
|
|