Article (Scientific journals)
Multi-relational graph contrastive learning with learnable graph augmentation.
Mo, Xian; PANG, Jun; Wan, Binyuan et al.
2024In Neural Networks, 181, p. 106757
Peer Reviewed verified by ORBi
 

Files


Full Text
NN25.pdf
Publisher postprint (1.43 MB)
Request a copy

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Contrastive learning; Graph augmentation; Knowledge graphs
Abstract :
[en] Multi-relational graph learning aims to embed entities and relations in knowledge graphs into low-dimensional representations, which has been successfully applied to various multi-relationship prediction tasks, such as information retrieval, question answering, and etc. Recently, contrastive learning has shown remarkable performance in multi-relational graph learning by data augmentation mechanisms to deal with highly sparse data. In this paper, we present a Multi-Relational Graph Contrastive Learning architecture (MRGCL) for multi-relational graph learning. More specifically, our MRGCL first proposes a Multi-relational Graph Hierarchical Attention Networks (MGHAN) to identify the importance between entities, which can learn the importance at different levels between entities for extracting the local graph dependency. Then, two graph augmented views with adaptive topology are automatically learned by the variant MGHAN, which can automatically adapt for different multi-relational graph datasets from diverse domains. Moreover, a subgraph contrastive loss is designed, which generates positives per anchor by calculating strongly connected subgraph embeddings of the anchor as the supervised signals. Comprehensive experiments on multi-relational datasets from three application domains indicate the superiority of our MRGCL over various state-of-the-art methods. Our datasets and source code are published at https://github.com/Legendary-L/MRGCL.
Disciplines :
Computer science
Author, co-author :
Mo, Xian ;  School of Information Engineering, Ningxia University, Yinchuan 750021, China, Ningxia Key Laboratory of Artificial Intelligence and Information Security for Channeling Computing Resources from the East to the West, Ningxia University, Yinchuan 750021, China. Electronic address: mxian168@nxu.edu.cn
PANG, Jun  ;  University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)
Wan, Binyuan;  School of Information Engineering, Ningxia University, Yinchuan 750021, China. Electronic address: binyuanw@outlook.com
Tang, Rui ;  School of Cyber Science and Engineering, Sichuan University, Chengdu 610065, Sichuan, China. Electronic address: tangrscu@scu.edu.cn
Liu, Hao;  School of Information Engineering, Ningxia University, Yinchuan 750021, China, Ningxia Key Laboratory of Artificial Intelligence and Information Security for Channeling Computing Resources from the East to the West, Ningxia University, Yinchuan 750021, China. Electronic address: liuhao@nxu.edu.cn
Jiang, Shuyu ;  School of Cyber Science and Engineering, Sichuan University, Chengdu 610065, Sichuan, China. Electronic address: jiang.shuyu07@gmail.com
External co-authors :
yes
Language :
English
Title :
Multi-relational graph contrastive learning with learnable graph augmentation.
Publication date :
26 September 2024
Journal title :
Neural Networks
ISSN :
0893-6080
eISSN :
1879-2782
Publisher :
Elsevier Ltd, United States
Volume :
181
Pages :
106757
Peer reviewed :
Peer Reviewed verified by ORBi
Funders :
National Natural Science Foundation of China
Available on ORBilu :
since 10 October 2024

Statistics


Number of views
77 (3 by Unilu)
Number of downloads
0 (0 by Unilu)

Scopus citations®
 
6
Scopus citations®
without self-citations
3
OpenCitations
 
0
OpenAlex citations
 
6

Bibliography


Similar publications



Contact ORBilu