.png){kind=icon}
.png){kind=icon}
返回
Explaining answers generated by knowledge graph embeddings
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijar.2024.109183.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Completion of large-scale knowledge bases, such as DBPedia or Freebase, often relies on embedding models that turn symbolic relations into vector -based representations. Such embedding models are rather opaque to the human user. Research in interpretability has emphasized non -relational classifiers, such as deep neural networks, and has devoted less effort to opaque models extracted from relational structures, such as knowledge graph embeddings. We introduce techniques that produce explanations, expressed as logical rules, for predictions based on the embeddings of knowledge graphs. Algorithms build explanations out of paths in an input knowledge graph, searched through contextual and heuristic cues.
Keyword:
Knowledge graphs
Embeddings
Link prediction
Interpretability
Explainable artificial intelligence