Coupling Relation Strength with Graph Convolutional Networks for Knowledge Graph Completion

Authors

  • Mingshao Xu Shenyang Normal University
  • Hang Li Shenyang Normal University
  • Zhi Hu Shenyang Normal University

Keywords:

Knowledge Graph Completion, Graph Convolutional Networks, Relation strength, Link prediction

Abstract

In the link prediction task of knowledge graph completion, Graph Neural Network (GNN)-based knowledge graph completion models have been shown by previous studies to produce large improvements in prediction results. However, many of the previous efforts were limited to aggregating the information given by neighboring nodes and did not take advantage of the information provided by the edges represented by relations. To address the problem, Coupling Relation Strength with Graph Convolutional Networks (RS-GCN) is proposed, which is a model with an encoder-decoder framework to realize the embedding of entities and relations in the vector space. On the encoder side, RS-GCN captures graph structure and neighborhood information while aggregating the information given by neighboring nodes. On the decoder side, RotatE is utilized to model and infer various relational patterns. The models are evaluated on standard FB15k, WN18, FB15k-237 and WN18RR datasets, and the experiments show that RS-GCN achieves better results than the current state-of-the-art classical models on the above knowledge graph datasets.

Downloads

Published

2024-07-02

How to Cite

Xu, M., Li, H., & Hu, Z. (2024). Coupling Relation Strength with Graph Convolutional Networks for Knowledge Graph Completion. IJLAI Transactions on Science and Engineering, 2(3), 9–18. Retrieved from https://ijlaitse.com/index.php/site/article/view/39