Pith. sign in

REVIEW 3 cited by

Knowledge Graph Large Language Model (KG-LLM) for Link Prediction

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 2403.07311 v9 pith:XEVYT3SK submitted 2024-03-12 cs.CL cs.LG

classification cs.CLcs.LG
keywords knowledgelanguageframeworkgraphkg-llmllmspredictionlarge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The task of multi-hop link prediction within knowledge graphs (KGs) stands as a challenge in the field of knowledge graph analysis, as it requires the model to reason through and understand all intermediate connections before making a prediction. In this paper, we introduce the Knowledge Graph Large Language Model (KG-LLM), a novel framework that leverages large language models (LLMs) for knowledge graph tasks. We first convert structured knowledge graph data into natural language and then use these natural language prompts to fine-tune LLMs to enhance multi-hop link prediction in KGs. By converting the KG to natural language prompts, our framework is designed to learn the latent representations of entities and their interrelations. To show the efficacy of the KG-LLM Framework, we fine-tune three leading LLMs within this framework, including Flan-T5, LLaMa2 and Gemma. Further, we explore the framework's potential to provide LLMs with zero-shot capabilities for handling previously unseen prompts. Experimental results show that KG-LLM significantly improves the models' generalization capabilities, leading to more accurate predictions in unfamiliar scenarios.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Node-as-Agent: Graph Agentic Network

    cs.CL 2025-08 conditional novelty 6.0 of 10

    A node-as-agent framework where a frozen LLM plans each node's local and global message passing achieves competitive Cora accuracy without training, but uses per-dataset prompt selection and leaves label-leakage quest...

  2. Toward Reliable Scientific Hypothesis Generation: Evaluating Truthfulness and Hallucination in Large Language Models

    cs.CL 2025-05 conditional novelty 6.0 of 10

    A new benchmark (TruthHypo) and a knowledge-grounded hallucination detector (KnowHD) show that grounding scores can partially select truthful LLM-generated biomedical hypotheses, but the result is at risk from knowled...

  3. GenIC: An LLM-Based Framework for Instance Completion in Knowledge Graphs

    cs.AI 2025-05 conditional novelty 4.0 of 10

    GenIC uses a Mistral-based classifier and a T5-based generator to complete knowledge graph facts from a head entity, outperforming simple baselines on FB15k-237, WN18RR, and CoDEx, with evaluation caveats.

Pith tools