Bayesian Robust Graph Contrastive Learning
원문 초록
Graph Neural Networks (GNNs) have been widely used to learn node representations and with outstanding performance on various tasks such as node classification. However, noise, which inevitably exists in real-world graph data, would considerably degrade the performance of GNNs as the noise is easily propagated via the graph structure. In this work, we propose a novel and robust method, Bayesian Robust Graph Contrastive Learning (BRGCL), which trains a GNN encoder to learn robust node representations. The BRGCL encoder is a completely unsupervised encoder. Two steps are iteratively executed at each epoch of training the BRGCL encoder: (1) estimating confident nodes and computing robust cluster prototypes of node representations through a novel Bayesian nonparametric method; (2) prototypical contrastive learning between the node representations and the robust cluster prototypes. Experiments on public and large-scale benchmarks demonstrate the superior performance of BRGCL and the robustness of the learned node representations. The code of BRGCL is available at \url{https://github.com/BRGCL-code/BRGCL-code}.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Mitigating Degree Bias Adaptively with Hard-to-Learn Nodes in Graph Contrastive Learning
Weak Supervision for Real World Graphs
Instance-Prototype Affinity Learning for Non-Exemplar Continual Graph Learning
Multi-modal Siamese Network for Entity Alignment
RadiomicsRetrieval: A Customizable Framework for Medical Image Retrieval Using Radiomics Features
NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.