RGDF: a structure-aware lightweight fusion for efficient and accurate knowledge graph completion
摘要
Knowledge graph link prediction aims to predict missing triples in a graph, with graph neural network (GNN)-based methods gaining attention for their strong performance. However, existing approaches often face challenges with high computational complexity when handling large-scale heterogeneous graphs. Additionally, they suffer from the oversmoothing problem in deep networks, where node embeddings become overly uniform, failing to capture complex graph structures and diverse relational features. To address these issues, we propose the Residual Gated Dual-stage Fusion (RGDF) model. By introducing a lightweight gating mechanism to dynamically integrate residual information and topological features, RGDF effectively preserves historical information and significantly enhances node embedding quality. Furthermore, a dual-stage modeling approach (local interaction and global modulation) strengthens the capture of nonlinear dependencies between nodes and relations. Extensive experiments on multiple benchmark datasets demonstrate that RGDF achieves substantial improvements in inference accuracy for complex relations and training efficiency compared to existing state-of-the-art methods.