arrow
Return

Knowledge graph completion method based on hyperbolic representation learning and contrastive learning

delete2023-12-01
delete0
delete
OA
AI
X
Xiaodong Zhang
王
王萌 (Meng Wang) *
X
Xiu-Wen Zhong
F
Feixu An
DOI:10.1016/j.eij.2023.100414delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Knowledge graph completion employs existing triples to deduce missing data, thereby enriching and enhancing graph completeness. Recent research has revealed that using hyperbolic representation learning in knowledge graph completion yields superior expressive and generalization capabilities. However, the long-tail problem and the presence of hyperbolic metrics make it challenging to effectively learn low-frequency entities or relations, resulting in embedding space distortion and impacting the original semantic relationships. Therefore, this paper proposes a knowledge graph completion method (Att-CL) that integrates hyperbolic representation learning and contrastive learning. In this approach, knowledge is embedded into a hyperbolic space, and samples with limited hierarchical characteristics and insufficient feature information are enhanced by introducing adversarial noise. The loss function of the embedded samples is backpropagated into embedding vectors, perturbations are adjusted in the gradient direction to promote smoothness and locality, and hyperparameters are introduced for fine-tuning the adversarial strength in the construction of adversarial samples for data augmentation to enhance model robustness. To mitigate data distortion due to hyperbolic metrics, a penalty term is introduced in the contrastive loss function to control the distances of the embedding vectors from the origin, thereby reducing the impact of the metrics and further improving the model's completion ability. Experimental results on the WN18RR and FB15K-237 benchmark datasets demonstrate significant improvements in metrics such as MRR, Hits@1, and Hits@3 compared to traditional knowledge graph completion models, providing ample evidence of the model's effectiveness.
Keywords:
Knowledge graph completion
Hyperbolic representation learning
Comparison learning
Adversarial samples
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Egyptian Informatics Journal cover
Egyptian Informatics Journal
IF:
4.3
Papers:
799
Citations:
1.4K

Organization

Nanjing Audit University cover
Nanjing Audit University
Scholars:
1.0K
Papers: 1.3K
Citations: 1.3K
U
university of toronto
Scholars:
14.8W
Papers: 12.0W
Citations: 165
Cited Papers

Cited Papers

A novel human leukaemic cell line, CTS, has a t(6;11) chromosomal translocation and characteristics of pluripotent stem cells
err2003-10-29
err0
PREAI
errHARUMI KAKUDA; TAKEYUKI SATO; YASUHIDE HAYASHI; YASUHIRO ENOMOTO; JUN TAKAYAMA; MUTSURO OHIRA; MASAO SETO; RYUZO UEDA; AKIRA FUSE; HIROO NIIMI
errShare
errSave
A Survey on Knowledge Graphs: Representation, Acquisition, and Applications
err2022-02-01
err1.3K
errOAAI
errJi, Shaoxiong; Pan, Shirui; Cambria, Erik; Marttinen, Pekka; Yu, Philip S.
errShare
errSave
A comprehensive overview of knowledge graph completion
err2022-11-01
err52
PREAI
errShen, Tong; Zhang, Fu; Cheng, Jingwei
errShare
errSave
Knowledge Graph Completion: A Review
err2020-01-01
err169
errOAAI
errChen, Zhe; Wang, Yuehan; Zhao, Bin; Cheng, Jing; Zhao, Xin; Duan, Zongtao
errShare
errSave
A review: Knowledge reasoning over knowledge graph
err2020-03-01
err550
PREAI
errChen, Xiaojun; Jia, Shengbin; Xiang, Yang
errShare
errSave
errShare
errSave
Rationale and Architecture Principles for Medical Application Platforms
err2012-04-01
err0
errOAAI
errJohn Hatcliff; Andrew King; Insup Lee; Alasdair Macdonald; Anura Fernando; Michael Robkin; Eugene Vasserman; Sandy Weininger; Julian M. Goldman
errShare
errSave
researcher View more