Open AccessOpen Access


Knowledge Graph Representation Learning Based on Automatic Network Search for Link Prediction

Zefeng Gu, Hua Chen*

China University of Petroleum (East China), Qingdao, 266555, China

* Corresponding Author: Hua Chen. Email:

(This article belongs to this Special Issue: Models of Computation: Specification, Implementation and Challenges)

Computer Modeling in Engineering & Sciences 2023, 135(3), 2497-2514.


Link prediction, also known as Knowledge Graph Completion (KGC), is the common task in Knowledge Graphs (KGs) to predict missing connections between entities. Most existing methods focus on designing shallow, scalable models, which have less expressive than deep, multi-layer models. Furthermore, most operations like addition, matrix multiplications or factorization are handcrafted based on a few known relation patterns in several well-known datasets, such as FB15k, WN18, etc. However, due to the diversity and complex nature of real-world data distribution, it is inherently difficult to preset all latent patterns. To address this issue, we propose KGE-ANS, a novel knowledge graph embedding framework for general link prediction tasks using automatic network search. KGE-ANS can learn a deep, multi-layer effective architecture to adapt to different datasets through neural architecture search. In addition, the general search space we designed is tailored for KG tasks. We perform extensive experiments on benchmark datasets and the dataset constructed in this paper. The results show that our KGE-ANS outperforms several state-of-the-art methods, especially on these datasets with complex relation patterns.


Cite This Article

Gu, Z., Chen, H. (2023). Knowledge Graph Representation Learning Based on Automatic Network Search for Link Prediction. CMES-Computer Modeling in Engineering & Sciences, 135(3), 2497–2514.

This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 612


  • 308


  • 0


Share Link