Relation Adversarial Network for Low Resource Knowledge Graph Completion
Knowledge Graph Completion (KGC) has been proposed to improve Knowledge Graphs by filling in missing connections via link prediction or relation extraction. One of the main difficulties for KGC is a low resource problem. Previous approaches assume sufficient training triples to learn versatile vectors for entities and relations, or a satisfactory number of labeled sentences to train a competent relation extraction model. However, low resource relations are very common in KGs, and those newly added relations often do not have many known samples for training. In this work, we aim at predicting new facts under a challenging setting where only limited training instances are available. We propose a general framework called Weighted Relation Adversarial Network, which utilizes an adversarial procedure to help adapt knowledge/features learned from high resource relations to different but related low resource relations. Specifically, the framework takes advantage of a relation discriminator to distinguish between samples from different relations, and help learn relation-invariant features more transferable from source relations to target relations. Experimental results show that the proposed approach outperforms previous methods regarding low resource settings for both link prediction and relation extraction.
Code (0)
등록된 구현이 없습니다.
Tasks
Domain AdaptationKnowledge Graph CompletionKnowledge GraphsLink PredictionPartial Domain AdaptationRelationRelation ExtractionSimilar Papers 제목 키워드 기반
A survey of embedding models of entities and relationships for knowledge graph completion
Knowledge graphs (KGs) of real-world facts about entities and their relationships are useful resources for a variety of natural language processing tasks. However, because knowledge graphs are typically incomplete, it is…
Knowledge Base CompletionKnowledge Graph CompletionKnowledge GraphsLink PredictionChallenging the Assumption of Structure-based embeddings in Few- and Zero-shot Knowledge Graph Completion
In this paper, we report experiments on Few- and Zero-shot Knowledge Graph completion, where the objective is to add missing relational links between entities into an existing Knowledge Graph with few or no previous exam…
DescriptiveKnowledge Graph CompletionTransfer LearningTriple Classification for Scholarly Knowledge Graph Completion
Scholarly Knowledge Graphs (KGs) provide a rich source of structured information representing knowledge encoded in scientific publications. With the sheer volume of published scientific literature comprising a plethora o…
ClassificationKnowledge Graph CompletionKnowledge GraphsLink Prediction+2KG-BERT: BERT for Knowledge Graph Completion
Knowledge graphs are important resources for many artificial intelligence tasks but often suffer from incompleteness. In this work, we propose to use pre-trained language models for knowledge graph completion. We treat t…
Knowledge Graph CompletionKnowledge GraphsLanguage ModelingLanguage Modelling+5Few-Shot Knowledge Graph Completion
Knowledge graphs (KGs) serve as useful resources for various natural language processing applications. Previous KG completion approaches require a large number of training instances (i.e., head-tail entity pairs) for eve…
Knowledge Graph CompletionKnowledge GraphsOne-Shot LearningRelation