Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/507496
Title: | Leveraging KG Embeddings for Knowledge Graph Question Answering |
Researcher: | Saxena, Apoorv Umang |
Guide(s): | Talukdar, Partha Pratim |
Keywords: | Computer Science Computer Science Software Engineering Engineering and Technology |
University: | Indian Institute of Science Bangalore |
Completed Date: | 2022 |
Abstract: | Knowledge graphs (KG) are multi-relational graphs consisting of entities as nodes and relations among them as typed edges. The goal of knowledge graph question answering (KGQA) is to answer natural language queries posed over the KG. These could be simple factoid questions such as What is the currency of USA? or it could be a more complex query such as Who was the president of USA after World War II? . Multiple systems have been proposed in the literature to perform KGQA, include question decomposition, semantic parsing and even graph neural network-based methods. In a separate line of research, KG embedding methods (KGEs) have been proposed to embed the entities and relations in the KG in low-dimensional vector space. These methods aim to learn representations that can be then utilized by various scoring functions to predict the plausibility of triples (facts) in the KG. Applications of KG embeddings include link prediction and KG completion. Such KG embedding methods, even though highly relevant, have not been explored for KGQA so far. In this work, we focus on 2 aspects of KGQA: (i) Temporal reasoning, and (ii) KG incompleteness. Here, we leverage recent advances in KG embeddings to improve model reasoning in the temporal domain, as well as use the robustness of embeddings to KG sparsity to improve incomplete KG question answering performance. We do this through the following contributions: Improving Multi-Hop KGQA using KG Embeddings We first tackle a subset of KGQA queries multi-hop KGQA. We propose EmbedKGQA, a method which uses ComplEx embeddings and scoring function to answer these queries. We find that EmbedKGQA is particularly effective at KGQA over sparse KGs, while it also relaxes the requirement of answer selection from a pre-specified local neighborhood, an undesirable constraint imposed by GNN-based for this task. Experiments show that EmbedKGQA is superior to several GNN-based methods on incomplete KGs across a variety of dataset scales. Question Answering over Temporal Knowledge Graphs ... |
Pagination: | |
URI: | http://hdl.handle.net/10603/507496 |
Appears in Departments: | Computational and Data Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
80_recommendation.pdf | Attached File | 141.89 kB | Adobe PDF | View/Open Request a copy |
abstract.pdf | 73.9 kB | Adobe PDF | View/Open Request a copy | |
annexures.pdf | 226.54 kB | Adobe PDF | View/Open Request a copy | |
chap1.pdf | 591.97 kB | Adobe PDF | View/Open Request a copy | |
chap2.pdf | 175.62 kB | Adobe PDF | View/Open Request a copy | |
chap3.pdf | 533.62 kB | Adobe PDF | View/Open Request a copy | |
chap4.pdf | 405.09 kB | Adobe PDF | View/Open Request a copy | |
chap5.pdf | 692.83 kB | Adobe PDF | View/Open Request a copy | |
prelim pages.pdf | 315.78 kB | Adobe PDF | View/Open Request a copy | |
title.pdf | 75.6 kB | Adobe PDF | View/Open Request a copy | |
toc.pdf | 55.08 kB | Adobe PDF | View/Open Request a copy |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: