Low-Dimensional Hyperbolic Knowledge Graph Embeddings

• URL: http://arxiv.org/abs/2005.00545v1
• Date: Fri, 1 May 2020 18:00:02 GMT
• Title: Low-Dimensional Hyperbolic Knowledge Graph Embeddings
• Authors: Ines Chami, Adva Wolf, Da-Cheng Juan, Frederic Sala, Sujith Ravi and Christopher R\'e
• Abstract summary: We introduce a class of hyperbolic KG embedding models that simultaneously capture hierarchical and logical patterns. Experimental results show that our method improves over previous Euclidean- and hyperbolic-based efforts by up to 6.1% in low dimensions. In high dimensions, our approach yields new state-of-the-art MRRs of 49.6% on WN18RR and 57.7% on YAGO3-10.
• Score: 40.32524961979543
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Knowledge graph (KG) embeddings learn low-dimensional representations of entities and relations to predict missing facts. KGs often exhibit hierarchical and logical patterns which must be preserved in the embedding space. For hierarchical data, hyperbolic embedding methods have shown promise for high-fidelity and parsimonious representations. However, existing hyperbolic embedding methods do not account for the rich logical patterns in KGs. In this work, we introduce a class of hyperbolic KG embedding models that simultaneously capture hierarchical and logical patterns. Our approach combines hyperbolic reflections and rotations with attention to model complex relational patterns. Experimental results on standard KG benchmarks show that our method improves over previous Euclidean- and hyperbolic-based efforts by up to 6.1% in mean reciprocal rank (MRR) in low dimensions. Furthermore, we observe that different geometric transformations capture different types of relations while attention-based transformations generalize to multiple relations. In high dimensions, our approach yields new state-of-the-art MRRs of 49.6% on WN18RR and 57.7% on YAGO3-10.

Related papers

• From Semantics to Hierarchy: A Hybrid Euclidean-Tangent-Hyperbolic Space Model for Temporal Knowledge Graph Reasoning [1.1372536310854844]
  Temporal knowledge graph (TKG) reasoning predicts future events based on historical data. Existing Euclidean models excel at capturing semantics but struggle with hierarchy. We propose a novel hybrid geometric space approach that leverages the strengths of both Euclidean and hyperbolic models.
  arXiv  Detail & Related papers  (2024-08-30T10:33:08Z)
• Explainable Sparse Knowledge Graph Completion via High-order Graph Reasoning Network [111.67744771462873]
  This paper proposes a novel explainable model for sparse Knowledge Graphs (KGs) It combines high-order reasoning into a graph convolutional network, namely HoGRN. It can not only improve the generalization ability to mitigate the information insufficiency issue but also provide interpretability.
  arXiv  Detail & Related papers  (2022-07-14T10:16:56Z)
• Geometry Contrastive Learning on Heterogeneous Graphs [50.58523799455101]
  This paper proposes a novel self-supervised learning method, termed as Geometry Contrastive Learning (GCL) GCL views a heterogeneous graph from Euclidean and hyperbolic perspective simultaneously, aiming to make a strong merger of the ability of modeling rich semantics and complex structures. Extensive experiments on four benchmarks data sets show that the proposed approach outperforms the strong baselines.
  arXiv  Detail & Related papers  (2022-06-25T03:54:53Z)
• Geometry Interaction Knowledge Graph Embeddings [153.69745042757066]
  We propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities.
  arXiv  Detail & Related papers  (2022-06-24T08:33:43Z)
• Hyperbolic Hierarchical Knowledge Graph Embeddings for Link Prediction in Low Dimensions [11.260501547769636]
  We propose a novel KGE model called $textbfHyp$erbolic $textbfH$ierarchical $textbfKGE$ (HypHKGE) This model introduces attention-based learnable curvatures for hyperbolic space, which helps preserve rich semantic hierarchies. Experiments demonstrate the effectiveness of the proposed HypHKGE model on the three benchmark datasets.
  arXiv  Detail & Related papers  (2022-04-28T03:41:41Z)
• Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones [64.75766944882389]
  We present ConE (Cone Embedding), a KG embedding model that is able to simultaneously model multiple hierarchical as well as non-hierarchical relations in a knowledge graph. In particular, ConE uses cone containment constraints in different subspaces of the hyperbolic embedding space to capture multiple heterogeneous hierarchies. Our approach yields new state-of-the-art Hits@1 of 45.3% on WN18RR and 16.1% on DDB14 (0.231 MRR)
  arXiv  Detail & Related papers  (2021-10-28T07:16:08Z)
• What is Learned in Knowledge Graph Embeddings? [3.224929252256631]
  A knowledge graph (KG) is a data structure which represents entities and relations as the vertices and edges of a directed graph with edge types. We investigate whether learning rules between relations is indeed what drives the performance of embedding-based methods. Using experiments on synthetic KGs, we show that KG models can learn motifs and how this ability is degraded by non-motif edges.
  arXiv  Detail & Related papers  (2021-10-19T13:52:11Z)
• BiQUE: Biquaternionic Embeddings of Knowledge Graphs [9.107095800991333]
  Existing knowledge graph embeddings (KGEs) compactly encode multi-relational knowledge graphs (KGs) It is crucial for KGE models to unify multiple geometric transformations so as to fully cover the multifarious relations in KGs. We propose BiQUE, a novel model that employs biquaternions to integrate multiple geometric transformations.
  arXiv  Detail & Related papers  (2021-09-29T13:05:32Z)
• Hyperbolic Graph Embedding with Enhanced Semi-Implicit Variational Inference [48.63194907060615]
  We build off of semi-implicit graph variational auto-encoders to capture higher-order statistics in a low-dimensional graph latent representation. We incorporate hyperbolic geometry in the latent space through a Poincare embedding to efficiently represent graphs exhibiting hierarchical structure.
  arXiv  Detail & Related papers  (2020-10-31T05:48:34Z)
• Knowledge Graph Embeddings in Geometric Algebras [14.269860621624392]
  We introduce a novel geometric algebra-based KG embedding framework, GeomE. Our framework subsumes several state-of-the-art KG embedding approaches and is advantageous with its ability of modeling various key relation patterns. Experimental results on multiple benchmark knowledge graphs show that theproposed approach outperforms existing state-of-the-art models for link prediction.
  arXiv  Detail & Related papers  (2020-10-02T13:36:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.