BiQUE: Biquaternionic Embeddings of Knowledge Graphs

• URL: http://arxiv.org/abs/2109.14401v1
• Date: Wed, 29 Sep 2021 13:05:32 GMT
• Title: BiQUE: Biquaternionic Embeddings of Knowledge Graphs
• Authors: Jia Guo and Stanley Kok
• Abstract summary: 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.
• Score: 9.107095800991333
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Knowledge graph embeddings (KGEs) compactly encode multi-relational knowledge graphs (KGs). Existing KGE models rely on geometric operations to model relational patterns. Euclidean (circular) rotation is useful for modeling patterns such as symmetry, but cannot represent hierarchical semantics. In contrast, hyperbolic models are effective at modeling hierarchical relations, but do not perform as well on patterns on which circular rotation excels. It is crucial for KGE models to unify multiple geometric transformations so as to fully cover the multifarious relations in KGs. To do so, we propose BiQUE, a novel model that employs biquaternions to integrate multiple geometric transformations, viz., scaling, translation, Euclidean rotation, and hyperbolic rotation. BiQUE makes the best trade-offs among geometric operators during training, picking the best one (or their best combination) for each relation. Experiments on five datasets show BiQUE's effectiveness.

Related papers

• R-CoT: Reverse Chain-of-Thought Problem Generation for Geometric Reasoning in Large Multimodal Models [86.06825304372613]
  We propose a two-stage Reverse Chain-of-Thought (R-CoT) geometry problem generation pipeline. First, we introduce GeoChain to produce high-fidelity geometric images and corresponding descriptions. We then design a Reverse A&Q method that reasons step-by-step based on the descriptions and generates questions in reverse from the reasoning results.
  arXiv  Detail & Related papers  (2024-10-23T13:58:39Z)
• Knowledge Graph Embeddings: A Comprehensive Survey on Capturing Relation Properties [5.651919225343915]
  Knowledge Graph Embedding (KGE) techniques play a pivotal role in transforming symbolic Knowledge Graphs into numerical representations. This paper addresses the complex mapping properties inherent in relations, such as one-to-one, one-to-many, many-to-one, and many-to-many mappings. We explore innovative ideas such as integrating multimodal information into KGE, enhancing relation pattern modeling with rules, and developing models to capture relation characteristics in dynamic KGE settings.
  arXiv  Detail & Related papers  (2024-10-16T08:54:52Z)
• Block-Diagonal Orthogonal Relation and Matrix Entity for Knowledge Graph Embedding [5.463034010805521]
  A Knowledge Graph embeddings (KGE) is to learn low-dimensional representations of entities and relations for predicting missing facts. We introduce OrthogonalE, a novel KGE model employing matrices for entities and block-diagonal matrices for relations. The experimental results indicate that our new KGE model, OrthogonalE, is both general and flexible, significantly outperforming state-of-the-art KGE models.
  arXiv  Detail & Related papers  (2024-01-11T15:13:00Z)
• A Comprehensive Study on Knowledge Graph Embedding over Relational Patterns Based on Rule Learning [49.09125100268454]
  Knowledge Graph Embedding (KGE) has proven to be an effective approach to solving the Knowledge Completion Graph (KGC) task. Relational patterns are an important factor in the performance of KGE models. We introduce a training-free method to enhance KGE models' performance over various relational patterns.
  arXiv  Detail & Related papers  (2023-08-15T17:30:57Z)
• Geometric Clifford Algebra Networks [53.456211342585824]
  We propose Geometric Clifford Algebra Networks (GCANs) for modeling dynamical systems. GCANs are based on symmetry group transformations using geometric (Clifford) algebras.
  arXiv  Detail & Related papers  (2023-02-13T18:48:33Z)
• 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)
• STaR: Knowledge Graph Embedding by Scaling, Translation and Rotation [20.297699026433065]
  Bilinear method is mainstream in Knowledge Graph Embedding (KGE), aiming to learn low-dimensional representations for entities and relations. Previous works have mainly discovered 6 important patterns like non-commutativity. We propose a corresponding bilinear model Scaling Translation and Rotation (STaR) consisting of the above two parts.
  arXiv  Detail & Related papers  (2022-02-15T02:06:22Z)
• Motif Learning in Knowledge Graphs Using Trajectories Of Differential Equations [14.279419014064047]
  Knowledge Graph Embeddings (KGEs) have shown promising performance on link prediction tasks. Many KGEs use the flat geometry which renders them incapable of preserving complex structures. We propose a neuro differential KGE that embeds nodes of a KG on the trajectories of Ordinary Differential Equations (ODEs)
  arXiv  Detail & Related papers  (2020-10-13T20:53:17Z)
• 5* Knowledge Graph Embeddings with Projective Transformations [13.723120574076127]
  We present a novel knowledge graph embedding model (5*E) in projective geometry. It supports multiple simultaneous transformations - specifically inversion, reflection, translation, rotation, and homothety. It outperforms existing approaches on the most widely used link prediction benchmarks.
  arXiv  Detail & Related papers  (2020-06-08T23:28:07Z)
• Learning Bijective Feature Maps for Linear ICA [73.85904548374575]
  We show that existing probabilistic deep generative models (DGMs) which are tailor-made for image data, underperform on non-linear ICA tasks. To address this, we propose a DGM which combines bijective feature maps with a linear ICA model to learn interpretable latent structures for high-dimensional data. We create models that converge quickly, are easy to train, and achieve better unsupervised latent factor discovery than flow-based models, linear ICA, and Variational Autoencoders on images.
  arXiv  Detail & Related papers  (2020-02-18T17:58:07Z)

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.