.png){kind=icon}
.png){kind=icon}
Return
A unified embedding-based relation completion framework for knowledge graph
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2024.111468.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The relation completion for knowledge graph requires expanding and enriching a knowledge graph by predicting the missing relation in a given triple which has known head and tail entities. In this paper, we propose a unified embedding -based relation completion framework which mainly includes two contributions. Firstly, based on embedding of triples generated by any embedding model, we utilize deep neural networks to learn feature representations of relations from head and tail entities. This allows us to propose a multidimensional feature prediction model for missing relations of triples. Based on the predictive features of missing relations, we match the best relation within the candidate relation set for relation completion. Secondly, to reduce the impact of noisy features and further improve the effectiveness of relation completion, we consider the extraction of key features as a submodular optimization problem by establishing a normalized, nondecreasing submodular function. Finally, testing on multiple public knowledge graph datasets, the results demonstrate that our proposed relation completion framework can significantly improve existing relation completion approaches.
Keywords:
Relation completion
Knowledge graph
Deep neural network
Submodular optimization
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W