CONHyperKGE: Using Contrastive Learning in Hyperbolic Space for Knowledge Graph Embedding

Abstract

The embedding of Knowledge Graphs (KGs) in hyperbolic space has recently received great attention in the field of deep learning because it can provide more accurate and concise representations of hierarchical structures compared to Euclidean spaces and complex spaces. Although hyperbolic space embeddings have shown significant improvements over Euclidean spaces and complex space embeddings in handling the task of KG embedding, they still face challenges related to the uneven distribution and insufficient alignment of high-dimensional sparse data. To address this issue, we propose the CONHyperKGE model, which leverages contrastive learning to optimize the embedding distribution in hyperbolic space. This approach enables better capture of hierarchical structures, improved handling of symmetry, and enhanced treatment of sparse matrices. Our proposed method is evaluated on four standard KG Embedding (KGE) datasets: WN18RR, FB15k-237, Kinship, and UMLS. After extensive experimental verification, our method has improved its performance on all four datasets. Notably, on the low-dimensional Kinship dataset, our method achieves an average Mean Reciprocal Rank (MRR) improvement of 2% over the original method, while on the high-dimensional WN18RR dataset, an average MRR improvement of 1% is observed compared to the original method.