ConvD: Attention Enhanced Dynamic Convolutional Embeddings for Knowledge Graph Completion
Not on the map. Why?
Abstract (arXiv)
Knowledge graphs often suffer from incompleteness issues, which can be alleviated through information completion. However, current state-of-the-art deep knowledge convolutional embedding models rely on external convolution kernels and conventional convolution processes, which limits the feature interaction capability of the model. This paper introduces a novel dynamic convolutional embedding model, ConvD, which directly reshapes relation embeddings into multiple internal convolution kernels. This approach effectively enhances the feature interactions between relation embeddings and entity embeddings. Simultaneously, we incorporate a priori knowledge-optimized attention mechanism that assigns different contribution weight coefficients to the multiple relation convolution kernels in dynamic convolution, further boosting the expressive power of the model. Extensive experiments on various datasets show that our proposed model consistently outperforms the state-of-the-art baseline methods, with average improvements ranging from 3.28% to 14.69% across all model evaluation metrics, while the number of parameters is reduced by 50.66% to 85.40% compared to other state-of-the-art models.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 28 of its 54 references that are in the map. First posted on arXiv 11 Dec 2023.
Builds on
28 of 54 references.
References · 28
- 2023A Survey of Large Language Modelscited by 2,537
- 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
- 2023A Survey on Evaluation of Large Language Modelscited by 1,227
- 2014Embedding Entities and Relations for Learning and Inference in Knowledge Basescited by 929
- 2016Complex Embeddings for Simple Link Predictioncited by 897
- 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 893
- 2017Convolutional 2D Knowledge Graph Embeddingscited by 729
- 2019TuckER: Tensor Factorization for Knowledge Graph Completioncited by 290
- 2018SimplE Embedding for Link Prediction in Knowledge Graphscited by 195
- 2020Low-Dimensional Hyperbolic Knowledge Graph Embeddingscited by 195
- 2015Holographic Embeddings of Knowledge Graphscited by 181
- 2017A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Networkcited by 143
16 more
- 2018End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completioncited by 136
- 2022Sequence-to-Sequence Knowledge Graph Completion and Question Answeringcited by 75
- 2017Analogical Inference for Multi-Relational Embeddingscited by 69
- 2017KBGAN: Adversarial Learning for Knowledge Graph Embeddingscited by 62
- 2019InteractE: Improving Convolution-based Knowledge Graph Embeddings by Increasing Feature Interactionscited by 58
- 2020HittER: Hierarchical Transformers for Knowledge Graph Embeddingscited by 54
- 2017Knowledge Graph Embedding with Iterative Guidance from Soft Rulescited by 51
- 2023Making Large Language Models Perform Better in Knowledge Graph Completioncited by 48
- 2018Improving Knowledge Graph Embedding Using Simple Constraintscited by 36
- 2015TransG : A Generative Mixture Model for Knowledge Graph Embeddingcited by 28
- 2017KBLRN : End-to-End Learning of Knowledge Base Representations with Latent, Relational, and Numerical Featurescited by 25
- 2023Editing Language Model-based Knowledge Graph Embeddingscited by 23
- 20205* Knowledge Graph Embeddings with Projective Transformationscited by 19
- 2020SEEK: Segmented Embedding of Knowledge Graphscited by 11
- 2020Knowledge Graph Embedding with Atrous Convolution and Residual Learningcited by 10
- 2021Self-attention Presents Low-dimensional Knowledge Graph Embeddings for Link Predictioncited by 8
Built on by
Citing papers per year: 2025: 2.
2 papers.