返回
Automated message selection for robust Heterogeneous Graph Contrastive Learning
DOI:10.1016/j.knosys.2024.112739.png)
摘要
En 中文
Heterogeneous Graph Contrastive Learning (HGCL) has attracted lots of attentions because of eliminating the requirement of node labels. The encoders used in HGCL mainly are message-passing based Heterogeneous Graph Neural Networks, which are vulnerable to edge perturbations. Recently, a few HGCL models replace the polluted graph with KNN graph or threshold graph, which both have flaws: (1) each node in KNN graph have the same degree K , it is irrational and loses original structural features; (2) the threshold is selected artificially, which hinders both effectiveness and interpretability. To tackle the above issues, we propose an Automated Message Selection based Heterogeneous Graph Contrastive Learning (AMS-HGCL) model. We first set relation view and meta-path view for contrast. Then, a robust encoder is proposed to defend structural attacks for both views by automatically selecting harmless messages, without setting all nodes having the same number of neighbors. The learned probabilities of messages can show harmful features directly, which makes our model interpretable. Finally, we design a novel cross-view contrastive loss to optimize AMS-HGCL and output robust node representations. The experimental results on four real datasets demonstrate that AMS-HGCL is feasible and effective.
Keyword:
Heterogeneous Graph Contrastive Learning
Automated graph learning
Robust heterogeneous graph learning
Graph structural attack defense
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
暂无机构信息
引用论文
Formylglycinamide Ribonucleotide Amidotransferase from Thermotoga maritima: Structural Insights into Complex Formation
Biochemistry
IF0
Self-supervised Graph-level Representation Learning with Adversarial Contrastive Learning基于对抗性对比学习的自监督图级表示学习

