InGram: Inductive Knowledge Graph Embedding via Relation Graphs
Inductive knowledge graph completion has been considered as the task of predicting missing triplets between new entities that are not observed during training. While most inductive knowledge graph completion methods assume that all entities can be new, they do not allow new relations to appear at inference time. This restriction prohibits the existing methods from appropriately handling real-world knowledge graphs where new entities accompany new relations. In this paper, we propose an INductive knowledge GRAph eMbedding method, InGram, that can generate embeddings of new relations as well as new entities at inference time. Given a knowledge graph, we define a relation graph as a weighted graph consisting of relations and the affinity weights between them. Based on the relation graph and the original knowledge graph, InGram learns how to aggregate neighboring embeddings to generate relation and entity embeddings using an attention mechanism. Experimental results show that InGram outperforms 14 different state-of-the-art methods on varied inductive learning scenarios.
Code (1)
Tasks
Entity EmbeddingsGraph EmbeddingInductive knowledge graph completionInductive LearningKnowledge Graph CompletionKnowledge Graph EmbeddingKnowledge GraphsRelationWorld KnowledgeSimilar Papers 제목 키워드 기반
Inductive Relation Prediction by Subgraph Reasoning
The dominant paradigm for relation prediction in knowledge graphs involves learning and operating on latent representations (i.e., embeddings) of entities and relations. However, these embedding-based methods do not expl…
Graph EmbeddingGraph Neural NetworkInductive BiasInductive knowledge graph completion+9Extending Transductive Knowledge Graph Embedding Models for Inductive Logical Relational Inference
Many downstream inference tasks for knowledge graphs, such as relation prediction, have been handled successfully by knowledge graph embedding techniques in the transductive setting. To address the inductive setting wher…
Graph EmbeddingGraph Neural NetworkInductive Relation PredictionKnowledge Graph Completion+3Meta-Knowledge Transfer for Inductive Knowledge Graph Embedding
Knowledge graphs (KGs) consisting of a large number of triples have become widespread recently, and many knowledge graph embedding (KGE) methods are proposed to embed entities and relations of a KG into continuous vector…
Entity EmbeddingsGraph EmbeddingInductive Relation PredictionKnowledge Graph Embedding+6Model Graph Inductive Learning for Knowledge Graph Completion
Link prediction in knowledge graphs fundamentally depends on the quality of learned embeddings for entities and relations. However, most existing methods derive these embeddings by aggregating only the local neighborhood…
Knowledge Graph CompletionInductive Link PredictionKnowledge GraphsTRIX: A More Expressive Model for Zero-shot Domain Transfer in Knowledge Graphs
Fully inductive knowledge graph models can be trained on multiple domains and subsequently perform zero-shot knowledge graph completion (KGC) in new unseen domains. This is an important capability towards the goal of hav…
Knowledge Graph CompletionKnowledge GraphsRelationRelation Prediction+1