# Knowledge Hypergraphs: Prediction Beyond Binary Relations

arXiv: https://arxiv.org/abs/1906.00137 · HTML: https://mlsanity.com/paper/1906.00137/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 1 Jun 2019.

## Built on by (most cited first, 3 of 3)

- [What is Event Knowledge Graph: A Survey](https://mlsanity.com/paper/2112.15280/) (2021)
- [Link Prediction on N-ary Relational Data Based on Relatedness Evaluation](https://mlsanity.com/paper/2104.10424/) (2021)
- [Few-shot Link Prediction on N-ary Facts](https://mlsanity.com/paper/2305.06104/) (2023)

## Abstract (arXiv)

Knowledge graphs store facts using relations between two entities. In this work, we address the question of link prediction in knowledge hypergraphs where relations are defined on any number of entities. While techniques exist (such as reification) that convert non-binary relations into binary ones, we show that current embedding-based methods for knowledge graph completion do not work well out of the box for knowledge graphs obtained through these techniques. To overcome this, we introduce HSimplE and HypE, two embedding-based methods that work directly with knowledge hypergraphs. In both models, the prediction is a function of the relation embedding, the entity embeddings and their corresponding positions in the relation. We also develop public datasets, benchmarks and baselines for hypergraph prediction and show experimentally that the proposed models are more effective than the baselines.