Hyperbolic Hierarchy-Aware Knowledge Graph Embedding for Link Prediction (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods are built on Euclidean space, which are difficult to handle hierarchical structures. |
| Approach: | They propose a KGE model with extended Poincaré Ball and polar coordinate system to capture hierarchical structures. |
| Outcome: | The proposed model captures hierarchical relationships with extended Poincaré Ball and polar coordinate system in hyperbolic space and achieves state-of-the-art results on part of link prediction tasks. |
Similar Papers
Enhancing Hyperbolic Knowledge Graph Embeddings via Lorentz Transformations (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph embedding rely on tangent approximation and are not fully hyperbolic. |
| Approach: | They propose a fully hyperbolic KGE method that represents entities as points in the Lorentz model and represents relations as the intrinsic transformation. |
| Outcome: | The proposed method captures various types of relations including hierarchical structures. |
Low-Dimensional Hyperbolic Knowledge Graph Embeddings (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for predicting missing facts do not account for hierarchical and logical patterns in KGs. |
| Approach: | They propose a class of hyperbolic KG embedding models that capture hierarchical and logical patterns. |
| Outcome: | Experimental results show that the proposed method improves by 6.1% in mean reciprocal rank in low dimensions over previous methods. |
Knowledge Association with Hyperbolic Knowledge Graph Embeddings (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge graphs (KGs) depend on high embedding dimensions and hierarchical structures to achieve expressiveness. |
| Approach: | They propose a hyperbolic relational graph neural network for KG embedding and capture knowledge associations with a high-dimensional transformation. |
| Outcome: | Experiments on entity alignment and type inference show the proposed method is effective and efficient. |
HyperKGR: Knowledge Graph Reasoning in Hyperbolic Space with Graph Neural Network Encoding Symbolic Path (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for linking knowledge graphs are incomplete and rely on Euclidean embeddings . a hyperbolic GNN framework embeds recursive learning trees in hyperbolical space . |
| Approach: | They propose a hyperbolic GNN framework that embeds recursive learning trees in hyperbolical space and generates query-specific embeddings. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on multiple benchmark datasets. |
Knowledge GeoGebra: Leveraging Geometry of Relation Embeddings in Knowledge Graph Completion (2024.lrec-main)
Copied to clipboard
| Challenge: | Knowledge graph embedding models are limited to the algebra and geometry of the entity embeddable space, the algebra of the relation embeddible space, and the interaction between relation and entity embeds. |
| Approach: | They propose a method that leverages the geometry of relation embeddings and generalizes it with the concept of a butterfly curve, consecutively. |
| Outcome: | The proposed model outperforms existing models on the WN18RR, FB15K-237 and YouTube benchmarks. |
Hyperbolic Geometry is Not Necessary: Lightweight Euclidean-Based Models for Low-Dimensional Knowledge Graph Embeddings (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Recent knowledge graph embedding models based on hyperbolic geometry are complicated than Euclidean operations. |
| Approach: | They propose to use hyperbolic geometry to generate high-fidelity and parsimonious representations of hierarchical patterns in knowledge graphs. |
| Outcome: | The proposed models achieve state-of-the-art performance on two widely-used datasets and cost less than RotH. |
Knowledge Graph Embedding with Hierarchical Relation Structure (D18-1)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding models embed entities and relations into latent vectors without leveraging rich information from relation structure. |
| Approach: | They extend existing KGE models to learn knowledge representations by leveraging relation structure . authors say their approach is capable of extending other KGEs . |
| Outcome: | The proposed approach can extend existing KGE models, and validates against baselines. |
Complex Hyperbolic Knowledge Graph Embeddings with Fast Fourier Transform (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies have shown that the choice of space for knowledge graph (KG) embeddings has significant effects on the performance of KG completion tasks. |
| Approach: | They propose to use the Fourier transform to convert between real and complex hyperbolic space to capture hierarchical patterns. |
| Outcome: | The proposed models outperform the baseline models for knowledge graph (KG) embeddings. |
3D Rotation and Translation for Hyperbolic Knowledge Graph Embedding (2024.eacl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embeddings do not capture relation patterns, but they capture symmetry, antisymmetry, inversion, commutative composition, non-commutable composition, hierarchy, and multiplicity. |
| Approach: | They propose a 3D Rotation and Translation in Hyperbolic space model that captures relation patterns simultaneously. |
| Outcome: | The proposed model outperforms state-of-the-art models in terms of accuracy, hierarchy property, and other relation patterns in low-dimensional space, while performing similarly in high-dimensional spaces. |
Knowledge Graph Representation Learning using Ordinary Differential Equations (2021.emnlp-main)
Copied to clipboard
| Challenge: | Knowledge Graph Embeddings (KGEs) map entities and relations from knowledge graphs into a geometric space. |
| Approach: | They propose a neuro differential KGE that embeds nodes of a KG on the trajectories of Ordinary Differential Equations (ODEs) they represent each relation (edge) in a knowledge graph as a vector field on several manifolds. |
| Outcome: | The proposed model can preserve graph characteristics including structural aspects and semantics and avoid wrong inferences. |