Fully Hyperbolic Rotation for Knowledge Graph Embedding

Qiuyu Liang, Weihua Wang, Feilong Bao, Guanglai Gao
11/6/2024
cs.AIcs.LG

No confident code implementation found for this paper.

Abstract

Hyperbolic rotation is commonly used to effectively model knowledge graphs and their inherent hierarchies. However, existing hyperbolic rotation models rely on logarithmic and exponential mappings for feature transformation. These models only project data features into hyperbolic space for rotation, limiting their ability to fully exploit the hyperbolic space. To address this problem, we propose a novel fully hyperbolic model designed for knowledge graph embedding. Instead of feature mappings, we define the model directly in hyperbolic space with the Lorentz model. Our model considers each relation in knowledge graphs as a Lorentz rotation from the head entity to the tail entity. We adopt the Lorentzian version distance as the scoring function for measuring the plausibility of triplets. Extensive results on standard knowledge graph completion benchmarks demonstrated that our model achieves competitive results with fewer parameters. In addition, our model get the state-of-the-art performance on datasets of CoDEx-s and CoDEx-m, which are more diverse and challenging than before. Our code is available at https://github.com/llqy123/FHRE.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{liang2024fully,
  title  = {Fully Hyperbolic Rotation for Knowledge Graph Embedding},
  author = {Qiuyu Liang and Weihua Wang and Feilong Bao and Guanglai Gao},
  year   = {2024},
  eprint = {2411.03622},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.03622v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.03622.svg)](https://codeofpaper.com/paper/2411.03622)

Discussion