paper-with-me

홈 › Papers

Talking to GDELT Through Knowledge Graphs

2025-03-10 · Audun Myers, Max Vargas, Sinan G. Aksoy, Cliff Joslyn, Benjamin Wilson, Tom Grimes

In this work we study various Retrieval Augmented Regeneration (RAG) approaches to gain an understanding of the strengths and weaknesses of each approach in a question-answering analysis. To gain this understanding we use a case-study subset of the Global Database of Events, Language, and Tone (GDELT) dataset as well as a corpus of raw text scraped from the online news articles. To retrieve information from the text corpus we implement a traditional vector store RAG as well as state-of-the-art large language model (LLM) based approaches for automatically constructing KGs and retrieving the relevant subgraphs. In addition to these corpus approaches, we develop a novel ontology-based framework for constructing knowledge graphs (KGs) from GDELT directly which leverages the underlying schema of GDELT to create structured representations of global events. For retrieving relevant information from the ontology-based KGs we implement both direct graph queries and state-of-the-art graph retrieval approaches. We compare the performance of each method in a question-answering task. We find that while our ontology-based KGs are valuable for question-answering, automated extraction of the relevant subgraphs is challenging. Conversely, LLM-generated KGs, while capturing event summaries, often lack consistency and interpretability. Our findings suggest benefits of a synergistic approach between ontology and LLM-based KG construction, with proposed avenues toward that end.

📄 PDF Abstract BibTeX arXiv:2503.07584

Code (0)

등록된 구현이 없습니다.

Tasks

ArticlesKnowledge GraphsLarge Language ModelQuestion AnsweringRAGRetrieval

Methods 이 논문이 사용한 방법론

Refunds@Expedia|||How do I get a full refund from Expedia? “How do I get a full refund from Expedia? How do I get a full refund from Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Quick Help &…
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Attention Dropout Attention Dropout is a type of dropout used in attention-based architectures, where elements are randomly dropped out of the…
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…
Linear Warmup With Linear Decay Linear Warmup With Linear Decay is a learning rate schedule in which we increase the learning rate linearly for $n$ updates and then linearly decay afterwards.
Residual Connection 설명 없음

Similar Papers 제목 키워드 기반

Tucker decomposition-based Temporal Knowledge Graph Completion

2020-11-16 · Pengpeng Shao, Guohua Yang, Dawei Zhang, JianHua Tao 외

Knowledge graphs have been demonstrated to be an effective tool for numerous intelligent applications. However, a large amount of valuable knowledge still exists implicitly in the knowledge graphs. To enrich the existing…

Knowledge Graph CompletionKnowledge GraphsLink PredictionTemporal Knowledge Graph Completion+1

Embedding Models for Episodic Knowledge Graphs

2018-06-30 · Yunpu Ma, Volker Tresp, Erik Daxberger

In recent years a number of large-scale triple-oriented knowledge graphs have been generated and various models have been proposed to perform learning in those graphs. Most knowledge graphs are static and reflect the wor…

Inductive LearningKnowledge Graph EmbeddingsKnowledge Graphs

A Simple But Powerful Graph Encoder for Temporal Knowledge Graph Completion

2022-01-16 · ACL ARR January 2022 1 · Anonymous

While knowledge graphs contain rich semantic knowledge about various entities and the relational information among them, temporal knowledge graphs (TKGs) describe and model the interactions of the entities over time. In …

Knowledge Graph CompletionKnowledge GraphsTemporal Knowledge Graph Completion

A Simple But Powerful Graph Encoder for Temporal Knowledge Graph Completion

2021-12-14 · Zifeng Ding, Yunpu Ma, Bailan He, Volker Tresp

Knowledge graphs contain rich knowledge about various entities and the relational information among them, while temporal knowledge graphs (TKGs) describe and model the interactions of the entities over time. In this cont…

Knowledge Graph CompletionKnowledge GraphsTemporal Knowledge Graph Completion

TaCE: Time-aware Convolutional Embedding Learning for Temporal Knowledge Graph Completion

2021-09-29 · Jin Luo, Hong Shen, YanFeng Hu, Chen Peng

Temporal knowledge graph completion (TKGC) is a challenging task to infer the missing component for quadruples. The key challenge lies at how to integrate time information into the embeddings of entities and relations. R…

Knowledge Graph CompletionKnowledge GraphsTemporal Knowledge Graph Completion