Approximate Answering of Graph Queries
- URL: http://arxiv.org/abs/2308.06585v1
- Date: Sat, 12 Aug 2023 14:47:21 GMT
- Title: Approximate Answering of Graph Queries
- Authors: Michael Cochez, Dimitrios Alivanistos, Erik Arakelyan, Max Berrendorf,
Daniel Daza, Mikhail Galkin, Pasquale Minervini, Mathias Niepert, Hongyu Ren
- Abstract summary: In this chapter, we will give an overview of several methods which have been proposed to answer queries in such a setting.
We will first provide an overview of the different query types which can be supported by these methods and datasets typically used for evaluation.
Then, we give an overview of the different approaches and describe them in terms of expressiveness, supported graph types, and inference capabilities.
- Score: 40.375299599925924
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Knowledge graphs (KGs) are inherently incomplete because of incomplete world
knowledge and bias in what is the input to the KG. Additionally, world
knowledge constantly expands and evolves, making existing facts deprecated or
introducing new ones. However, we would still want to be able to answer queries
as if the graph were complete. In this chapter, we will give an overview of
several methods which have been proposed to answer queries in such a setting.
We will first provide an overview of the different query types which can be
supported by these methods and datasets typically used for evaluation, as well
as an insight into their limitations. Then, we give an overview of the
different approaches and describe them in terms of expressiveness, supported
graph types, and inference capabilities.
Related papers
- Bottom-up Anytime Discovery of Generalised Multimodal Graph Patterns for Knowledge Graphs [0.0]
We introduce an algorithm for the bottom-up discovery of generalized multimodal graph patterns in knowledge graphs.
Upon discovery, the patterns are converted to SPARQL queries and presented in an interactive facet browser.
We evaluate our method from a user perspective, with the help of domain experts in the humanities.
arXiv Detail & Related papers (2024-10-08T09:07:27Z) - One Model, Any Conjunctive Query: Graph Neural Networks for Answering Complex Queries over Knowledge Graphs [7.34044245579928]
We propose AnyCQ, a graph neural network model that can classify answers to any conjunctive query on any knowledge graph.
We show that AnyCQ can generalize to large queries of arbitrary structure, reliably classifying and retrieving answers to samples where existing approaches fail.
arXiv Detail & Related papers (2024-09-21T00:30:44Z) - QAGCF: Graph Collaborative Filtering for Q&A Recommendation [58.21387109664593]
Question and answer (Q&A) platforms usually recommend question-answer pairs to meet users' knowledge acquisition needs.
This makes user behaviors more complex, and presents two challenges for Q&A recommendation.
We introduce Question & Answer Graph Collaborative Filtering (QAGCF), a graph neural network model that creates separate graphs for collaborative and semantic views.
arXiv Detail & Related papers (2024-06-07T10:52:37Z) - G-Retriever: Retrieval-Augmented Generation for Textual Graph Understanding and Question Answering [61.93058781222079]
We develop a flexible question-answering framework targeting real-world textual graphs.
We introduce the first retrieval-augmented generation (RAG) approach for general textual graphs.
G-Retriever performs RAG over a graph by formulating this task as a Prize-Collecting Steiner Tree optimization problem.
arXiv Detail & Related papers (2024-02-12T13:13:04Z) - Open-Set Knowledge-Based Visual Question Answering with Inference Paths [79.55742631375063]
The purpose of Knowledge-Based Visual Question Answering (KB-VQA) is to provide a correct answer to the question with the aid of external knowledge bases.
We propose a new retriever-ranker paradigm of KB-VQA, Graph pATH rankER (GATHER for brevity)
Specifically, it contains graph constructing, pruning, and path-level ranking, which not only retrieves accurate answers but also provides inference paths that explain the reasoning process.
arXiv Detail & Related papers (2023-10-12T09:12:50Z) - A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic,
and Multimodal [57.8455911689554]
Knowledge graph reasoning (KGR) aims to deduce new facts from existing facts based on mined logic rules underlying knowledge graphs (KGs)
It has been proven to significantly benefit the usage of KGs in many AI applications, such as question answering, recommendation systems, and etc.
arXiv Detail & Related papers (2022-12-12T08:40:04Z) - Semantic Structure based Query Graph Prediction for Question Answering
over Knowledge Graph [5.5332967798665305]
This paper focuses on query graph generation from natural language questions.
Existing approaches for query graph generation ignore the semantic structure of a question.
We develop a novel Structure-BERT to predict the semantic structure of a question.
arXiv Detail & Related papers (2022-04-15T20:35:00Z) - AnswerSumm: A Manually-Curated Dataset and Pipeline for Answer
Summarization [73.91543616777064]
Community Question Answering (CQA) fora such as Stack Overflow and Yahoo! Answers contain a rich resource of answers to a wide range of community-based questions.
One goal of answer summarization is to produce a summary that reflects the range of answer perspectives.
This work introduces a novel dataset of 4,631 CQA threads for answer summarization, curated by professional linguists.
arXiv Detail & Related papers (2021-11-11T21:48:02Z) - Query Embedding on Hyper-relational Knowledge Graphs [0.4779196219827507]
Multi-hop logical reasoning is an established problem in the field of representation learning on knowledge graphs.
We extend the multi-hop reasoning problem to hyper-relational KGs allowing to tackle this new type of complex queries.
arXiv Detail & Related papers (2021-06-15T14:08:50Z) - Approximate Knowledge Graph Query Answering: From Ranking to Binary
Classification [0.20999222360659608]
Structured querying on incomplete graphs will result in incomplete sets of answers.
Several algorithms for approximate structured query answering have been proposed.
We argue that performing a ranking-based evaluation is not sufficient to assess methods for complex query answering.
arXiv Detail & Related papers (2021-02-22T22:28:08Z)
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.