Relations Prediction for Knowledge Graph Completion using Large Language Models

Sakher Khalil Alqaaidi, Krzysztof Kochut
5/4/2024
cs.CLcs.AI

No confident code implementation found for this paper. 5 possible matches can be shown below.

Abstract

Knowledge Graphs have been widely used to represent facts in a structured format. Due to their large scale applications, knowledge graphs suffer from being incomplete. The relation prediction task obtains knowledge graph completion by assigning one or more possible relations to each pair of nodes. In this work, we make use of the knowledge graph node names to fine-tune a large language model for the relation prediction task. By utilizing the node names only we enable our model to operate sufficiently in the inductive settings. Our experiments show that we accomplish new scores on a widely used knowledge graph benchmark.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 5 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Knowledge Graph Completion using Structural and Textual Embeddings

93% match1 repo42024

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

88% match1 repo22025

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

88% match2024

Explainable Representations for Relation Prediction in Knowledge Graphs

88% match1 repo32023

Knowledge Graph Embedding: An Overview

88% match2023

Multi-perspective Improvement of Knowledge Graph Completion with Large Language Models

87% match1 repo562024

Cite this paper

@article{alqaaidi2024relations,
  title  = {Relations Prediction for Knowledge Graph Completion using Large Language Models},
  author = {Sakher Khalil Alqaaidi and Krzysztof Kochut},
  year   = {2024},
  eprint = {2405.02738},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.02738v1}
}

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/2405.02738.svg)](https://codeofpaper.com/paper/2405.02738)

Discussion