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

Amel Gader, Alsayed Algergawy
5/29/2025
cs.AIcs.IR

Official code: amal-gader/genic (2 stars, last commit 2024-10-02).

Abstract

Knowledge graph completion aims to address the gaps of knowledge bases by adding new triples that represent facts. The complexity of this task depends on how many parts of a triple are already known. Instance completion involves predicting the relation-tail pair when only the head is given (h, ?, ?). Notably, modern knowledge bases often contain entity descriptions and types, which can provide valuable context for inferring missing facts. By leveraging these textual descriptions and the ability of large language models to extract facts from them and recognize patterns within the knowledge graph schema, we propose an LLM-powered, end-to-end instance completion approach. Specifically, we introduce GenIC: a two-step Generative Instance Completion framework. The first step focuses on property prediction, treated as a multi-label classification task. The second step is link prediction, framed as a generative sequence-to-sequence task. Experimental results on three datasets show that our method outperforms existing baselines. Our code is available at https://github.com/amal-gader/genic.

View on arXivView PDF

Code Implementations(1)

amal-gader/genicOfficial100%
20Shell, PythonOct 2, 20242 years ago

Similar Papers

Cite this paper

@article{gader2025genic,
  title  = {GenIC: An LLM-Based Framework for Instance Completion in Knowledge Graphs},
  author = {Amel Gader and Alsayed Algergawy},
  year   = {2025},
  eprint = {2505.24036},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.24036v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.24036.svg)](https://codeofpaper.com/paper/2505.24036)

Discussion