REVIEW 4 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
Signed reviews
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.
Forward citations
Cited by 4 Pith papers
-
Enhancing Large Language Model for Knowledge Graph Completion via Structure-Aware Alignment-Tuning
SAT uses hierarchical contrastive alignment and a unified graph instruction to tune a lightweight adapter for knowledge graph completion, reporting large link prediction gains.
-
Deep Sparse Latent Feature Models for Knowledge Graph Completion
DSLFM-KGC couples sparse latent community models with BERT text features and contrastive learning, improving state-of-the-art scores on Wikidata5M-Ind, WN18RR, and UMLS.
-
Way to Specialist: Closing Loop Between Specialized LLM and Evolving Domain Knowledge Graph
WTS couples retrieval-augmented generation with an LLM-built, evolving domain knowledge graph and reports SOTA gains, but its main experiments use test-set gold answers to construct the graph.
-
Enhancing Persona Classification in Dialogue Systems: A Graph Neural Network Approach
A graph neural network over semantically similar personas improves multi-label persona classification compared with embedding-only models, mainly when training data is limited.
Discussion (0). Continue with ORCID to comment.