Disconnected Emerging Knowledge Graph Oriented Inductive Link Prediction
Inductive link prediction (ILP) is to predict links for unseen entities in emerging knowledge graphs (KGs), considering the evolving nature of KGs. A more challenging scenario is that emerging KGs consist of only unseen entities, called as disconnected emerging KGs (DEKGs). Existing studies for DEKGs only focus on predicting enclosing links, i.e., predicting links inside the emerging KG. The bridging links, which carry the evolutionary information from the original KG to DEKG, have not been investigated by previous work so far. To fill in the gap, we propose a novel model entitled DEKG-ILP (Disconnected Emerging Knowledge Graph Oriented Inductive Link Prediction) that consists of the following two components. (1) The module CLRM (Contrastive Learning-based Relation-specific Feature Modeling) is developed to extract global relation-based semantic features that are shared between original KGs and DEKGs with a novel sampling strategy. (2) The module GSM (GNN-based Subgraph Modeling) is proposed to extract the local subgraph topological information around each link in KGs. The extensive experiments conducted on several benchmark datasets demonstrate that DEKG-ILP has obvious performance improvements compared with state-of-the-art methods for both enclosing and bridging link prediction. The source code is available online.
Code (1)
Tasks
Contrastive LearningInductive Link PredictionKnowledge GraphsLink PredictionPredictionRelationSimilar Papers 제목 키워드 기반
Inductive Learning on Commonsense Knowledge Graph Completion
Commonsense knowledge graph (CKG) is a special type of knowledge graph (KG), where entities are composed of free-form text. However, most existing CKG completion methods focus on the setting where all the entities are pr…
DecoderEntity EmbeddingsInductive LearningKnowledge Graph Completion+2Cumulative Path-Level Semantic Reasoning for Inductive Knowledge Graph Completion
Conventional Knowledge Graph Completion (KGC) methods aim to infer missing information in incomplete Knowledge Graphs (KGs) by leveraging existing information, which struggle to perform effectively in scenarios involving…
Inductive knowledge graph completionKnowledge GraphsAn Open Challenge for Inductive Link Prediction on Knowledge Graphs
An emerging trend in representation learning over knowledge graphs (KGs) moves beyond transductive link prediction tasks over a fixed set of known entities in favor of inductive tasks that imply training on one graph and…
Graph Representation LearningInductive Link PredictionKnowledge GraphsLink Prediction+1Query-Enhanced Adaptive Semantic Path Reasoning for Inductive Knowledge Graph Completion
Conventional Knowledge graph completion (KGC) methods aim to infer missing information in incomplete Knowledge Graphs (KGs) by leveraging existing information, which struggle to perform effectively in scenarios involving…
Inductive knowledge graph completionKnowledge Graph CompletionKnowledge GraphsOne Subgraph for All: Efficient Reasoning on Opening Subgraphs for Inductive Knowledge Graph Completion
Knowledge Graph Completion (KGC) has garnered massive research interest recently, and most existing methods are designed following a transductive setting where all entities are observed during training. Despite the great…
AllGraph ClassificationInductive knowledge graph completionKnowledge Graph Completion