Is Complex Query Answering Really Complex?
Complex query answering (CQA) on knowledge graphs (KGs) is gaining momentum as a challenging reasoning task. In this paper, we show that the current benchmarks for CQA are not really complex, and the way they are built distorts our perception of progress in this field. For example, we find that in these benchmarks, most queries (up to 98% for some query types) can be reduced to simpler problems, e.g., link prediction, where only one link needs to be predicted. The performance of state-of-the-art CQA models drops significantly when such models are evaluated on queries that cannot be reduced to easier types. Thus, we propose a set of more challenging benchmarks, composed of queries that require models to reason over multiple hops and better reflect the construction of real-world KGs. In a systematic empirical investigation, the new benchmarks show that current methods leave much to be desired from current CQA methods.
Code (0)
등록된 구현이 없습니다.
Tasks
Complex Query AnsweringKnowledge GraphsLink PredictionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Meta Operator for Complex Query Answering on Knowledge Graphs
Knowledge graphs contain informative factual knowledge but are considered incomplete. To answer complex queries under incomplete knowledge, learning-based Complex Query Answering (CQA) models are proposed to directly lea…
Complex Query AnsweringKnowledge GraphsMeta-LearningMulti-Task LearningAdapting Neural Link Predictors for Data-Efficient Complex Query Answering
Answering complex queries on incomplete knowledge graphs is a challenging task where a model needs to answer complex logical queries in the presence of missing knowledge. Prior work in the literature has proposed to addr…
Complex Query AnsweringKnowledge GraphsLink PredictionType-based Neural Link Prediction Adapter for Complex Query Answering
Answering complex logical queries on incomplete knowledge graphs (KGs) is a fundamental and challenging task in multi-hop reasoning. Recent work defines this task as an end-to-end optimization problem, which significantl…
Complex Query AnsweringKnowledge GraphsLink PredictionQuery Graph Generation for Answering Multi-hop Complex Questions from Knowledge Bases
Previous work on answering complex questions from knowledge bases usually separately addresses two types of complexity: questions with constraints and questions with multiple hops of relations. In this paper, we handle b…
Graph GenerationSPARQL query generation for complex question answering with BERT and BiLSTM-based model
In this paper we describe question answering system for answering of complex questions over Wikidata knowledge base. Unlike simple questions, which require extraction of single fact from the knowledge base, complex quest…
Knowledge Base Question AnsweringQuestion AnsweringSemantic ParsingTriplet