SOTAVerified

Complex Query Answering

This task is concerned with answering complex queries over incomplete knowledge graphs. In the most simple case, the task is reduced to link prediction: a 1-hop query for predicting the existence of an edge between a pair of nodes. Complex queries are concerned with other structures between nodes, such as 2-hop and 3-paths, and intersecting paths with intermediate variables.

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 21–30 of 33 papers

TitleStatusHype
Knowledge Graph Papers @ ICLR 2021—0
Type-based Neural Link Prediction Adapter for Complex Query Answering—0
Meta Operator for Complex Query Answering on Knowledge Graphs—0
Neural-Symbolic Entangled Framework for Complex Query Answering—0
Neural-Symbolic Message Passing with Dynamic Pruning—0
Approximate Knowledge Graph Query Answering: From Ranking to Binary Classification—0
Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering—0
Transformers for Complex Query Answering over Knowledge Hypergraphs—0
Conditional Logical Message Passing Transformer for Complex Query AnsweringCode0
QubitE: Qubit Embedding for Knowledge Graph CompletionCode0
Show:102550
← PrevPage 3 of 4Next →

No leaderboard results yet.