Graph Attention Networks Fusing Semantic Information for Knowledge Graph Completion

Knowledge graph embedding aims to embed triples into low-dimensional vector spaces. Through the attention mechanism, models based on the graph attention network can learn the information of the neighboring node, improving knowledge graph completion and enriching the structural information. On the other hand, because of the shallow graph attention network, these models can only learn local structural information and cannot capture the global semantic properties of entities and relations. They also only use linear matrices to update relations, ignoring the impact of neighboring information on relations. We propose a fused semantic information graph attention network (FSI-GAT) to address the above challenges for knowledge graph completion. FSI-GAT consists of three modules: structural information learning module, semantic information learning module, and scoring module. The structural information learning module adopts the improved graph attention network to learn the local structural information of entities and relations; the semantic information learning module encodes the descriptive statements of entities and relations through the BERT pretrained language model to obtain the global semantic information; and the scoring module uses the ConvE to score the candidate tail entities. The experimental results show that FSI-GAT significantly outperforms the existing models on the link prediction task and can effectively improve the link prediction performance.

Authors

Institutions

Publication Details

Published
2024-10-26
DOI
https://doi.org/10.1109/cisp-bmei64163.2024.10906235
Primary Topic
Cognitive Computing and Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Graph Attention Networks Fusing Semantic Information for Knowledge Graph Completion

Min Li, LI Xue-jun, Jing Liao
Cognitive Computing and Networks
article

Graph Attention Networks Fusing Semantic Information for Knowledge Graph Completion

Min Li, LI Xue-jun, Jing Liao
article en

Abstract

Knowledge graph embedding aims to embed triples into low-dimensional vector spaces. Through the attention mechanism, models based on the graph attention network can learn the information of the neighboring node, improving knowledge graph completion and enriching the structural information. On the other hand, because of the shallow graph attention network, these models can only learn local structural information and cannot capture the global semantic properties of entities and relations. They also only use linear matrices to update relations, ignoring the impact of neighboring information on relations. We propose a fused semantic information graph attention network (FSI-GAT) to address the above challenges for knowledge graph completion. FSI-GAT consists of three modules: structural information learning module, semantic information learning module, and scoring module. The structural information learning module adopts the improved graph attention network to learn the local structural information of entities and relations; the semantic information learning module encodes the descriptive statements of entities and relations through the BERT pretrained language model to obtain the global semantic information; and the scoring module uses the ConvE to score the candidate tail entities. The experimental results show that FSI-GAT significantly outperforms the existing models on the link prediction task and can effectively improve the link prediction performance.

Southwest University of Science and Technology (CN)
Openalex Percentile: Top 74%
Cognitive Computing and Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.