A Continual Relation Extraction Approach for Knowledge Graph Completeness

Sefika Efeoglu
4/20/2024
cs.DLcs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Representing unstructured data in a structured form is most significant for information system management to analyze and interpret it. To do this, the unstructured data might be converted into Knowledge Graphs, by leveraging an information extraction pipeline whose main tasks are named entity recognition and relation extraction. This thesis aims to develop a novel continual relation extraction method to identify relations (interconnections) between entities in a data stream coming from the real world. Domain-specific data of this thesis is corona news from German and Austrian newspapers.

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. 1 weaker match is 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

Cite this paper

@article{efeoglu2024continual,
  title  = {A Continual Relation Extraction Approach for Knowledge Graph Completeness},
  author = {Sefika Efeoglu},
  year   = {2024},
  eprint = {2404.17593},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.17593v1}
}

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

Discussion