A Continual Relation Extraction Approach for Knowledge Graph Completeness

• URL: http://arxiv.org/abs/2404.17593v1
• Date: Sat, 20 Apr 2024 18:15:52 GMT
• Title: A Continual Relation Extraction Approach for Knowledge Graph Completeness
• Authors: Sefika Efeoglu,
• Abstract summary: This thesis aims to develop a novel continual relation extraction method to identify relations 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Web-Scale Visual Entity Recognition: An LLM-Driven Data Approach [56.55633052479446]
  Web-scale visual entity recognition presents significant challenges due to the lack of clean, large-scale training data. We propose a novel methodology to curate such a dataset, leveraging a multimodal large language model (LLM) for label verification, metadata generation, and rationale explanation. Experiments demonstrate that models trained on this automatically curated data achieve state-of-the-art performance on web-scale visual entity recognition tasks.
  arXiv  Detail & Related papers  (2024-10-31T06:55:24Z)
• Decoupled Subgraph Federated Learning [57.588938805581044]
  We address the challenge of federated learning on graph-structured data distributed across multiple clients. We present a novel framework for this scenario, named FedStruct, that harnesses deep structural dependencies. We validate the effectiveness of FedStruct through experimental results conducted on six datasets for semi-supervised node classification.
  arXiv  Detail & Related papers  (2024-02-29T13:47:23Z)
• Coarse-to-fine Knowledge Graph Domain Adaptation based on Distantly-supervised Iterative Training [12.62127290494378]
  We propose an integrated framework for adapting and re-learning knowledge graphs. No manual data annotation is required to train the model. We introduce a novel iterative training strategy to facilitate the discovery of domain-specific named entities and triples.
  arXiv  Detail & Related papers  (2022-11-05T08:16:38Z)
• ConstGCN: Constrained Transmission-based Graph Convolutional Networks for Document-level Relation Extraction [24.970508961370548]
  Document-level relation extraction with graph neural networks faces a fundamental graph construction gap between training and inference. We propose $textbfConstGCN$, a novel graph convolutional network which performs knowledge-based information propagation between entities. Experimental results show that our method outperforms the previous state-of-the-art (SOTA) approaches on the DocRE dataset.
  arXiv  Detail & Related papers  (2022-10-08T07:36:04Z)
• Knowledge Graph Augmented Network Towards Multiview Representation Learning for Aspect-based Sentiment Analysis [96.53859361560505]
  We propose a knowledge graph augmented network (KGAN) to incorporate external knowledge with explicitly syntactic and contextual information. KGAN captures the sentiment feature representations from multiple perspectives, i.e., context-, syntax- and knowledge-based. Experiments on three popular ABSA benchmarks demonstrate the effectiveness and robustness of our KGAN.
  arXiv  Detail & Related papers  (2022-01-13T08:25:53Z)
• End-to-End Hierarchical Relation Extraction for Generic Form Understanding [0.6299766708197884]
  We present a novel deep neural network to jointly perform both entity detection and link prediction. Our model extends the Multi-stage Attentional U-Net architecture with the Part-Intensity Fields and Part-Association Fields for link prediction. We demonstrate the effectiveness of the model on the Form Understanding in Noisy Scanned Documents dataset.
  arXiv  Detail & Related papers  (2021-06-02T06:51:35Z)
• Knowledge Graph Anchored Information-Extraction for Domain-Specific Insights [1.6308268213252761]
  We use a task-based approach for fulfilling specific information needs within a new domain. A pipeline constructed of state of the art NLP technologies is used to automatically extract an instance level semantic structure.
  arXiv  Detail & Related papers  (2021-04-18T19:28:10Z)
• Cross-Supervised Joint-Event-Extraction with Heterogeneous Information Networks [61.950353376870154]
  Joint-event-extraction is a sequence-to-sequence labeling task with a tag set composed of tags of triggers and entities. We propose a Cross-Supervised Mechanism (CSM) to alternately supervise the extraction of triggers or entities. Our approach outperforms the state-of-the-art methods in both entity and trigger extraction.
  arXiv  Detail & Related papers  (2020-10-13T11:51:17Z)
• ENT-DESC: Entity Description Generation by Exploring Knowledge Graph [53.03778194567752]
  In practice, the input knowledge could be more than enough, since the output description may only cover the most significant knowledge. We introduce a large-scale and challenging dataset to facilitate the study of such a practical scenario in KG-to-text. We propose a multi-graph structure that is able to represent the original graph information more comprehensively.
  arXiv  Detail & Related papers  (2020-04-30T14:16:19Z)
• Exploiting Structured Knowledge in Text via Graph-Guided Representation Learning [73.0598186896953]
  We present two self-supervised tasks learning over raw text with the guidance from knowledge graphs. Building upon entity-level masked language models, our first contribution is an entity masking scheme. In contrast to existing paradigms, our approach uses knowledge graphs implicitly, only during pre-training.
  arXiv  Detail & Related papers  (2020-04-29T14:22:42Z)
• Siamese Graph Neural Networks for Data Integration [11.41207739004894]
  We propose a general approach to modeling and integrating entities from structured data, such as relational databases, as well as unstructured sources, such as free text from news articles. Our approach is designed to explicitly model and leverage relations between entities, thereby using all available information and preserving as much context as possible. We evaluate our method on the task of integrating data about business entities, and we demonstrate that it outperforms standard rule-based systems, as well as other deep learning approaches that do not use graph-based representations.
  arXiv  Detail & Related papers  (2020-01-17T21:51:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.