.png){kind=icon}
返回
A path-based relation networks model for knowledge graph completion
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2021.115273.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of learning and inference in a large-scale knowledge graph containing incomplete knowledge. We show that a simple neural network module for relational reasoning through the path extracted from the knowledge base can be used to reliably infer new facts for the missing link. In our work, we used path ranking algorithm to extract the relation path from knowledge graph and use it to build train data. In order to learn the characteristics of relation, a detour path between nodes was created as training data using the extracted relation path. Using this, we trained a model that can predict whether a given triple (Head entity, relation, tail entity) is valid or not. Experiments show that our model obtains better link prediction, relation prediction and triple classification results than previous state-of-the-art models on benchmark datasets WN18RR, FB15k-237, WN11 and FB13.
Keyword:
Knowledge graph completion
Relation network
Link prediction
Triple classification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
A convolutional neural network-based model for knowledge base completion and its application to search personalization.png)
SEMANTIC WEB
OAAI
SEMANTIC WEBIF2.9
OAAI分享收藏分享收藏
Trampoline-Related Quadriplegia: Review of the Literature and Reflections on the American Academy of Pediatrics' Position StatementPediatrics
PediatricsIF0
PREAI
分享收藏
查看更多内容