方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 加权知识图谱分析× | 加权介数中心性× | |
|---|---|---|
| 领域 | 网络分析 | 网络分析 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2010s–present | 2010 |
| 提出者≠ | Hogan et al. and the broader knowledge graph community | Opsahl, T.; Agneessens, F.; Skvoretz, J. (extending Freeman 1977 and Brandes 2001) |
| 类型≠ | Network analysis variant | Centrality measure (path-based) |
| 开创性文献≠ | Hogan, A., Blomqvist, E., Cochez, M., d'Amato, C., Melo, G., Gutierrez, C., Kirrane, S., Gayo, J. E. L., Navigli, R., Neumaier, S., Ngomo, A. N., Polleres, A., Rashid, S. M., Rula, A., Schmelzeisen, L., Sequeda, J., Staab, S., & Zimmermann, A. (2021). Knowledge Graphs. ACM Computing Surveys, 54(4), 1–37. DOI ↗ | Opsahl, T., Agneessens, F., & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251. DOI ↗ |
| 别名 | WKGA, weighted KG analysis, confidence-weighted knowledge graph, weighted semantic network analysis | WBC, weighted shortest-path betweenness, edge-weighted betweenness, geodesic betweenness (weighted) |
| 相关 | 6 | 6 |
| 摘要≠ | Weighted Knowledge Graph Analysis extends standard knowledge graph methods by assigning numerical weights — such as confidence scores, co-occurrence frequencies, or relation strengths — to edges between entities. These weights allow analysts to prioritise high-confidence triples, find the most influential paths, and compute weight-aware centrality and community structure in large structured knowledge bases. | Weighted Betweenness Centrality extends Freeman's betweenness measure to edge-weighted graphs by routing shortest paths through a tunable transformation of edge weights. Nodes that sit on many high-value shortest paths receive high scores, identifying brokers and bridges in social, biological, and information networks where tie strength matters. |
| ScholarGate数据集 ↗ |
|
|