arrow
Return

A knowledge graph embedding model based attention mechanism for enhanced node information integration

delete2024-01-22
delete1
delete
OA
AI
Y
Ying Liu
P
Peng Wang *
D
Di Yang
N
Ningjia Qiu
DOI:10.7717/peerj-cs.1808delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
The purpose of knowledge embedding is to extract entities and relations from the knowledge graph into low -dimensional dense vectors, in order to be applied to downstream tasks, such as connection prediction and intelligent classification. Existing knowledge embedding methods still have many limitations, such as the contradiction between the vast amount of data and limited computing power, and the challenge of effectively representing rare entities. This article proposed a knowledge embedding learning model, which incorporates a graph attention mechanism to integrate key node information. It can effectively aggregate key information from the global graph structure, shield redundant information, and represent rare nodes in the knowledge base independently of its own structure. We introduce a relation update layer to further update the relation based on the results of entity training. The experiment shows that our method matches or surpasses the performance of other baseline models in link prediction on the FB15K-237 dataset. The metric Hits@1 has increased by 10.9% compared to the second -ranked baseline model. In addition, we conducted further analysis on rare nodes with fewer neighborhoods, confirming that our model can embed rare nodes more accurately than the baseline models.
Keywords:
Artificial intelligence
Knowledge graph embedding
Link prediction
Graph attention mechanism
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

PeerJ Computer Science cover
PeerJ Computer Science
IF:
2.5
Papers:
3.4K
Citations:
6.9K

Organization

C
changchun university of science & technology
Scholars:
6.7K
Papers: 4.2K
Citations: 3