KERMIT: Knowledge Graph Completion of Enhanced Relation Modeling with Inverse Transformation
Knowledge graph completion (KGC) revolves around populating missing triples in a knowledge graph using available information. Text-based methods, which depend on textual descriptions of triples, often encounter difficulties when these descriptions lack sufficient information for accurate prediction-an issue inherent to the datasets and not easily resolved through modeling alone. To address this and ensure data consistency, we first use large language models (LLMs) to generate coherent descriptions, bridging the semantic gap between queries and answers. Secondly, we utilize inverse relations to create a symmetric graph, thereby providing augmented training samples for KGC. Additionally, we employ the label information inherent in knowledge graphs (KGs) to enhance the existing contrastive framework, making it fully supervised. These efforts have led to significant performance improvements on the WN18RR and FB15k-237 datasets. According to standard evaluation metrics, our approach achieves a 4.2% improvement in Hit@1 on WN18RR and a 3.4% improvement in Hit@3 on FB15k-237, demonstrating superior performance.
Code (1)
Tasks
DiversityKnowledge Graph CompletionKnowledge GraphsLink PredictionRelationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Context-Enhanced Entity and Relation Embedding for Knowledge Graph Completion
Most researches for knowledge graph completion learn representations of entities and relations to predict missing links in incomplete knowledge graphs. However, these methods fail to take full advantage of both the conte…
Knowledge Graph CompletionKnowledge GraphsRelationNNKGC: Improving Knowledge Graph Completion with Node Neighborhoods
Knowledge graph completion (KGC) aims to discover missing relations of query entities. Current text-based models utilize the entity name and description to infer the tail entity given the head entity and a certain relati…
Knowledge Graph CompletionLink PredictionAssociation Rules Enhanced Knowledge Graph Attention Network
Most existing knowledge graphs suffer from incompleteness. Embedding knowledge graphs into continuous vector spaces has recently attracted increasing interest in knowledge base completion. However, in most existing embed…
Graph AttentionGraph EmbeddingKnowledge Base CompletionKnowledge Graph Completion+4Knowledge Graph Completion with Relation-Aware Anchor Enhancement
Text-based knowledge graph completion methods take advantage of pre-trained language models (PLM) to enhance intrinsic semantic connections of raw triplets with detailed text descriptions. Typical methods in this branch …
Knowledge Graph CompletionLink PredictionRelationConvD: Attention Enhanced Dynamic Convolutional Embeddings for Knowledge Graph Completion
Knowledge graphs generally suffer from incompleteness, which can be alleviated by completing the missing information. Deep knowledge convolutional embedding models based on neural networks are currently popular methods f…
Entity EmbeddingsKnowledge Graph CompletionKnowledge GraphsRelation