Pith. sign in

REVIEW 1 cited by

KERMIT: Knowledge Graph Completion of Enhanced Relation Modeling with Inverse Transformation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.14770 v3 pith:O7YWPZ4S submitted 2023-09-26 cs.CL

KERMIT: Knowledge Graph Completion of Enhanced Relation Modeling with Inverse Transformation

classification cs.CL
keywords graphknowledgedescriptionsinformationcompletiondatasetsfb15k-237improvement
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Enhancing Large Language Model for Knowledge Graph Completion via Structure-Aware Alignment-Tuning

    cs.CL 2025-09 reject novelty 6.0

    SAT uses hierarchical contrastive alignment and a unified graph instruction to tune a lightweight adapter for knowledge graph completion, reporting large link prediction gains.