3260 papers • 126 benchmarks • 313 datasets
Given two entities, make a binary prediction if they have ancestor-descendant relationship, based on existing and missing hierarchical edges in the graph.
(Image credit: Papersgraph)
These leaderboards are used to track progress in ancestor-descendant-prediction-1
Use these libraries to find ancestor-descendant-prediction-1 models and implementations
No subtasks available.
ConE (Cone Embedding) is presented, a KG embedding model that is able to simultaneously model multiple hierarchical as well as non-hierarchical relations in a knowledge graph and outperforms previous best results on hierarchical reasoning task.
Adding a benchmark result helps the community track progress.