.png){kind=icon}
.png){kind=icon}
Return
C-KGE: Curriculum learning-based Knowledge Graph Embedding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.csl.2024.101689.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Knowledge graph embedding (KGE) aims to embed entities and relations in knowledge graphs (KGs) into a continuous, low-dimensional vector space. It has been shown as an effective tool for integrating knowledge graphs to improve various intelligent applications, such as question answering and information extraction. However, previous KGE models ignore the hidden natural order of knowledge learning on learning the embeddings of entities and relations, leaving room for improvement in their performance. Inspired by the easy-to-hard pattern used in human knowledge learning, this paper proposes a C urriculum learning-based KGE (C-KGE) model, which learns the embeddings of entities and relations from basic knowledgeto domain knowledge. Specifically, a seed set representing the basic knowledge and several knowledge subsets are identified from KG. Then, entity overlap is employed to score the learning difficulty of each subset. Finally, C-KGE trains the entities and relations in each subset according to the learning difficulty score of each subset. C-KGE leverages trained embeddings of the seed set as prior knowledge and learns knowledge subsets iteratively to transfer knowledge between the seed set and subsets, smoothing the learning process of knowledge facts. Experimental results on real-world datasets demonstrate that the proposed model achieves improved embedding performances as well as reducing training time. Our codes and data will be released later.
Keywords:
Knowledge graph embedding
Knowledge graph
Curriculum learning
Link prediction
Journal
C
IF:
3.4
Papers:
1.5K
Citations:
2.6K