方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 加权多层网络分析× | 加权特征向量中心性× | |
|---|---|---|
| 领域 | 网络分析 | 网络分析 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2014 | 1987 (binary); 2010 (weighted generalization) |
| 提出者≠ | Battiston, F.; Kivela, M. et al. | Bonacich, P. (binary); Opsahl, T. et al. (weighted extension) |
| 类型≠ | Network analysis framework | Spectral centrality measure |
| 开创性文献≠ | Battiston, F., Nicosia, V., & Latora, V. (2014). Structural measures for multiplex networks. Physical Review E, 89(3), 032804. DOI ↗ | Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. DOI ↗ |
| 别名 | WMNA, weighted multilayer network analysis, weighted multi-relational network analysis, multiplex weighted graph analysis | WEC, weighted spectral centrality, strength-weighted eigenvector centrality, weighted eigenvector prestige |
| 相关≠ | 5 | 6 |
| 摘要≠ | Weighted multiplex network analysis studies systems in which the same set of actors are connected through multiple types of relationships simultaneously, and each relationship carries a quantitative strength or frequency. By capturing both the variety and the intensity of ties across layers, it reveals patterns invisible to single-layer or unweighted network approaches. | 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. |
| ScholarGate数据集 ↗ |
|
|