mlsanityData to 7 Oct 2026

Shrinking Embeddings for Hyper-Relational Knowledge Graphs

arXiv 2306.02199 ↗First posted 3 Jun 2023cs.AIcited by 12

Not on the map. Why?

Abstract (arXiv)

Link prediction on knowledge graphs (KGs) has been extensively studied on binary relational KGs, wherein each fact is represented by a triple. A significant amount of important knowledge, however, is represented by hyper-relational facts where each fact is composed of a primal triple and a set of qualifiers comprising a key-value pair that allows for expressing more complicated semantics. Although some recent works have proposed to embed hyper-relational KGs, these methods fail to capture essential inference patterns of hyper-relational facts such as qualifier monotonicity, qualifier implication, and qualifier mutual exclusion, limiting their generalization capability. To unlock this, we present ShrinkE, a geometric hyper-relational KG embedding method aiming to explicitly model these patterns. ShrinkE models the primal triple as a spatial-functional transformation from the head into a relation-specific box. Each qualifier ``shrinks'' the box to narrow down the possible answer set and, thus, realizes qualifier monotonicity. The spatial relationships between the qualifier boxes allow for modeling core inference patterns of qualifiers such as implication and mutual exclusion. Experimental results demonstrate ShrinkE's superiority on three benchmarks of hyper-relational KGs.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 28 of its 48 references that are in the map. First posted on arXiv 3 Jun 2023.

Builds on

28 of 48 references.

References · 28

  1. 2016Complex Embeddings for Simple Link Predictioncited by 897
  2. 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 893
  3. 2019Composition-based Multi-Relational Graph Convolutional Networkscited by 395
  4. 2019TuckER: Tensor Factorization for Knowledge Graph Completioncited by 290
  5. 2018SimplE Embedding for Link Prediction in Knowledge Graphscited by 195
  6. 2020Low-Dimensional Hyperbolic Knowledge Graph Embeddingscited by 195
  7. 2020Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddingscited by 169
  8. 2020BoxE: A Box Embedding Model for Knowledge Base Completioncited by 105
  9. 2017Knowledge Graph Completion via Complex Tensor Factorizationcited by 80
  10. 2020Message Passing for Hyper-Relational Knowledge Graphscited by 78
  11. 2021ConE: Cone Embeddings for Multi-Hop Reasoning over Knowledge Graphscited by 78
  12. 2020Fairness-Aware Explainable Recommendation over Knowledge Graphscited by 74
16 more
  1. 2018Probabilistic Embedding of Knowledge Graphs with Box Lattice Measurescited by 64
  2. 2016On the representation and embedding of knowledge bases beyond binary relationscited by 55
  3. 2019EL Embeddings: Geometric construction of models for the Description Logic EL ++cited by 48
  4. 2020Generalizing Tensor Decomposition for N-ary Relational Knowledge Basescited by 38
  5. 2021Modeling Scale-free Graphs with Hyperbolic Geometry for Knowledge-aware Recommendationcited by 38
  6. 2021Role-Aware Modeling for N-ary Relational Knowledge Basescited by 29
  7. 2021Link Prediction on N-ary Relational Facts: A Graph-based Approachcited by 29
  8. 2022Faithiful Embeddings for EL++ Knowledge Basescited by 25
  9. 2022Ultrahyperbolic Knowledge Graph Embeddingscited by 20
  10. 2021Improving Hyper-Relational Knowledge Graph Completioncited by 18
  11. 2021Link Prediction on N-ary Relational Data Based on Relatedness Evaluationcited by 15
  12. 2021Searching to Sparsify Tensor Decomposition for N-ary Relational Datacited by 13
  13. 2023HiPrompt: Few-Shot Biomedical Knowledge Fusion via Hierarchy-Oriented Promptingcited by 11
  14. 2022Learning Representations for Hyper-Relational Knowledge Graphscited by 8
  15. 2023Geometric Relational Embeddings: A Surveycited by 8
  16. 2023Modeling Relational Patterns for Logical Query Answering over Knowledge Graphscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 5; 2025: 3; 2026: 2.

12 papers.