Learnable Convolutional Attention Network for Knowledge Graph Completion

Recently, graph convolutional networks (GCNs) and graph attention networks (GATs) have been used extensively in knowledge graph completion (KGC), which aims to solve the incompleteness of knowledge graphs (KGs). However, both GCNs and GATs have limitations in the KGC task, and the best method is analyzing the neighbors of each entity (pre-validating), while this process is prohibitively expensive. Furthermore, relations in KGs have specific semantics and should be considered when aggregating neighbor information (message passing). To address the above limitations, we propose a learnable convolutional attention network for knowledge graph completion named LCA-KGC. LCA-KGC introduces a knowledge graph convolutional attention network using a convolution operation before the attention mechanism to ensure structural information acquisition and avoid redundant information stacking. Furthermore, to complete the autonomous switching of GNNs types and eliminate the necessity of pre-validating the local structure of KGs, LCA-KGC designs a learnable knowledge graph convolutional attention network by comprising three types of GNNs in one learnable formulation. Moreover, a learnable message function is proposed to emphasize relational semantics when aggregating neighbor information. Extensive experiments on standard KG datasets validate the effectiveness of the proposed innovations, and LCA-KGC achieves state-of-the-art (SOTA) performance compared to existing approaches (e.g., compared to SOTA approaches, LCA-KGC improves MRR from 0.360 to 0.372 on FB15k-237 dataset, and Hits@3 from 0.561 to 0.581 on YAGO3-10 dataset).