Papers › KERMIT: Knowledge Graph Completion of Enhanced Relation Modeling with Inverse Transformation
KERMIT: Knowledge Graph Completion of Enhanced Relation Modeling with Inverse Transformation
Haotian Li, Bin Yu, Yuliang Wei, Kai Wang, Richard Yi Da Xu, Bailing Wang
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.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
1 archive task tag without a task page not shown.
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Link Prediction | FB15k-237 | KERMIT | Hits@1 | 0.266 | #21 of 75 | Archive leaderboard | report |
| Link Prediction | FB15k-237 | KERMIT | Hits@10 | 0.547 | #21 of 75 | Archive leaderboard | report |
| Link Prediction | FB15k-237 | KERMIT | Hits@3 | 0.396 | #21 of 75 | Archive leaderboard | report |
| Link Prediction | FB15k-237 | KERMIT | MRR | 0.359 | #21 of 75 | Archive leaderboard | report |
| Link Prediction | WN18RR | KERMIT | Hits@1 | 0.629 | #2 of 75 | Archive leaderboard | report |
| Link Prediction | WN18RR | KERMIT | Hits@10 | 0.832 | #2 of 75 | Archive leaderboard | report |
| Link Prediction | WN18RR | KERMIT | Hits@3 | 0.738 | #2 of 75 | Archive leaderboard | report |
| Link Prediction | WN18RR | KERMIT | MRR | 0.700 | #2 of 75 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections