Approximate Knowledge Graph Query Answering: From Ranking to Binary Classification
Large, heterogeneous datasets are characterized by missing or even erroneous information. This is more evident when they are the product of community effort or automatic fact extraction methods from external sources, such as text. A special case of the aforementioned phenomenon can be seen in knowledge graphs, where this mostly appears in the form of missing or incorrect edges and nodes. Structured querying on such incomplete graphs will result in incomplete sets of answers, even if the correct entities exist in the graph, since one or more edges needed to match the pattern are missing. To overcome this problem, several algorithms for approximate structured query answering have been proposed. Inspired by modern Information Retrieval metrics, these algorithms produce a ranking of all entities in the graph, and their performance is further evaluated based on how high in this ranking the correct answers appear. In this work we take a critical look at this way of evaluation. We argue that performing a ranking-based evaluation is not sufficient to assess methods for complex query answering. To solve this, we introduce Message Passing Query Boxes (MPQB), which takes binary classification metrics back into use and shows the effect this has on the recently proposed query embedding method MPQE.
Code (0)
등록된 구현이 없습니다.
Tasks
Binary ClassificationClassificationComplex Query AnsweringGeneral ClassificationInformation RetrievalKnowledge GraphsRetrievalSimilar Papers 제목 키워드 기반
A Method of Query Graph Reranking for Knowledge Base Question Answering
This paper presents a novel reranking method to better choose the optimal query graph, a sub-graph of knowledge graph, to retrieve the answer for an input question in Knowledge Base Question Answering (KBQA). Existing me…
Graph RankingKnowledge Base Question AnsweringQuestion AnsweringRerankingLearning to Rank Query Graphs for Complex Question Answering over Knowledge Graphs
In this paper, we conduct an empirical investigation of neural query graph ranking approaches for the task of complex question answering over knowledge graphs. We experiment with six different ranking models and propose …
Graph RankingKnowledge GraphsLearning-To-RankQuestion Answering+1Neural Scalable Symbolic Search Framework for Complex Logical Queries with Multiple Free Variables
Complex Query Answering (CQA) is a fundamental knowledge representation and reasoning task over incomplete knowledge graphs (KGs). Answering existential first-order queries with $k$ free variables (i.e., $\text{EFO}_k$ q…
Complex Query AnsweringKnowledge GraphsBetter Query Graph Selection for Knowledge Base Question Answering
This paper presents a novel approach based on semantic parsing to improve the performance of Knowledge Base Question Answering (KBQA). Specifically, we focus on how to select an optimal query graph from a candidate set s…
Knowledge Base Question AnsweringQuestion AnsweringSemantic ParsingSemantic Structure based Query Graph Prediction for Question Answering over Knowledge Graph
Building query graphs from natural language questions is an important step in complex question answering over knowledge graph (Complex KGQA). In general, a question can be correctly answered if its query graph is built c…
Graph GenerationQuestion Answering