方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 加权紧密度中心性× | 特征向量中心性× | |
|---|---|---|
| 领域 | 网络分析 | 网络分析 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2010 | 1972 |
| 提出者≠ | Opsahl, T.; Agneessens, F.; Skvoretz, J. | Bonacich, P. |
| 类型≠ | Centrality measure (network analysis) | Centrality measure |
| 开创性文献≠ | Opsahl, T., Agneessens, F. & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251. DOI ↗ | Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120. DOI ↗ |
| 别名 | weighted closeness, generalized closeness centrality, WCC, distance-weighted closeness | eigenvector centrality, EC, Bonacich centrality, power centrality |
| 相关 | 6 | 6 |
| 摘要≠ | Weighted closeness centrality extends the classic closeness measure to networks where edges carry numerical weights — such as frequency, strength, or cost — by incorporating those weights into shortest-path distances. Nodes that can reach others quickly along strong or efficient connections receive higher scores, making it a richer indicator of information-spreading potential than its binary counterpart. | Eigenvector centrality, introduced by Bonacich in 1972, measures a node's influence by considering not just how many neighbors it has, but how influential those neighbors are. A node scores highly if it is connected to other high-scoring nodes, making it a recursive, globally-aware measure of structural importance in a network. |
| ScholarGate数据集 ↗ |
|
|