Hits@3 2p: 0.350Hits@3 3p: 0.288Hits@3 ip: 0.171Hits@3 pi: 0.277
Papers with Code · CC BY-SA 4.0
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.
논문
MRR 1p: 0.892MRR 2p: 0.645MRR 3p: 0.579MRR 2i: 0.761
MRR 1p: 0.895MRR 2p: 0.674MRR 3p: 0.588MRR 2i: 0.803
MRR 1p: 0.651MRR 2p: 0.257MRR 3p: 0.247MRR 2i: 0.558
MRR 1p: 0.885MRR 2p: 0.693MRR 3p: 0.587MRR 2i: 0.797
MRR 1p: 0.68MRR 2p: 0.21MRR 3p: 0.142MRR 2i: 0.551
MRR 1p: 0.546MRR 2p: 0.153MRR 3p: 0.108MRR 2i: 0.397
AVGp-MRR: 0.7584