Enhancing Knowledge Graph Completion with GNN Distillation and Probabilistic Interaction Modeling
Knowledge graphs (KGs) serve as fundamental structures for organizing interconnected data across diverse domains. However, most KGs remain incomplete, limiting their effectiveness in downstream applications. Knowledge graph completion (KGC) aims to address this issue by inferring missing links, but existing methods face critical challenges: deep graph neural networks (GNNs) suffer from over-smoothing, while embedding-based models fail to capture abstract relational features. This study aims to overcome these limitations by proposing a unified framework that integrates GNN distillation and abstract probabilistic interaction modeling (APIM). GNN distillation approach introduces an iterative message-feature filtering process to mitigate over-smoothing, preserving the discriminative power of node representations. APIM module complements this by learning structured, abstract interaction patterns through probabilistic signatures and transition matrices, allowing for a richer, more flexible representation of entity and relation interactions. We apply these methods to GNN-based models and the APIM to embedding-based KGC models, conducting extensive evaluations on the widely used WN18RR and FB15K-237 datasets. Our results demonstrate significant performance gains over baseline models, showcasing the effectiveness of the proposed techniques. The findings highlight the importance of both controlling information propagation and leveraging structured probabilistic modeling, offering new avenues for advancing knowledge graph completion. And our codes are available at https://anonymous.4open.science/r/APIM_and_GNN-Distillation-461C.
Code (0)
등록된 구현이 없습니다.
Tasks
Knowledge Graph CompletionKnowledge GraphsSimilar Papers 제목 키워드 기반
CasPoinTr: Point Cloud Completion with Cascaded Networks and Knowledge Distillation
Point clouds collected from real-world environments are often incomplete due to factors such as limited sensor resolution, single viewpoints, occlusions, and noise. These challenges make point cloud completion essential …
Knowledge DistillationPoint Cloud CompletionPoint CloudsProbabilistic Knowledge Graph Construction: Compositional and Incremental Approaches
Knowledge graph construction consists of two tasks: extracting information from external resources (knowledge population) and inferring missing information through a statistical analysis on the extracted information (kno…
graph constructionCollective Knowledge Graph Completion with Mutual Knowledge Distillation
Knowledge graph completion (KGC), the task of predicting missing information based on the existing relational data inside a knowledge graph (KG), has drawn significant attention in recent years. However, the predictive p…
Knowledge DistillationKnowledge Graph CompletionKnowledge GraphsTransfer LearningLogical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning
Probabilistic logical rule learning has shown great strength in logical rule mining and knowledge graph completion. It learns logical rules to predict missing edges by reasoning on existing edges in the knowledge graph. …
Knowledge Graph CompletionKnowledge GraphsLink PredictionSelf-Distillation with Meta Learning for Knowledge Graph Completion
In this paper, we propose a selfdistillation framework with meta learning(MetaSD) for knowledge graph completion with dynamic pruning, which aims to learn compressed graph embeddings and tackle the longtail samples. Spec…
Knowledge Graph CompletionMeta-LearningTransfer Learning