Machine learningNetwork science
有向知识图谱分析
有向知识图谱分析将事实知识表示为实体（节点）和类型化关系（有向边）的有向标记多重图，从而能够对大型异构数据集进行结构化推理、推断和发现。边的方向编码了诸如“作者是”、“引起”、“是”等非对称关系，使得图谱比无向图谱更具语义丰富性。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Hogan, A., Blomqvist, E., Cochez, M., d'Amato, C., Melo, G. D., Gutierrez, C., ... & Polleres, A. (2021). Knowledge graphs. ACM Computing Surveys, 54(4), 1–37. DOI: 10.1145/3447772 ↗
- Wang, Z., Zhang, J., Feng, J., & Chen, Z. (2014). Knowledge Graph Embedding by Translating on Hyperplanes. Proceedings of the AAAI Conference on Artificial Intelligence, 28(1), 1112–1119. link ↗
如何引用本页
ScholarGate. (2026, June 3). Directed Knowledge Graph Analysis (Graph-Based Knowledge Representation and Reasoning). ScholarGate. https://scholargate.app/zh/network-analysis/directed-knowledge-graph-analysis
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- 中间性中心度网络分析↔ compare
- 有向社区检测网络分析↔ compare
- 定向PageRank网络分析↔ compare
- 定向社交网络分析网络分析↔ compare
- 特征向量中心性网络分析↔ compare
- 知识图谱分析网络分析↔ compare