.png){kind=icon}
Return
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
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 L earning 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.
Keywords:
Contrastive learning
Learnable graph augmentation
Multi-relational graph learning
Journal
IF:
6.3
Papers:
8.3K
Citations:
3.0W
Organization
Cited Papers
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
ShareSaveShareSave
View more