Self-supervised Graph-level Representation Learning with Local and Global Structure
This paper studies unsupervised/self-supervised whole-graph representation learning, which is critical in many tasks such as molecule properties prediction in drug and material discovery. Existing methods mainly focus on preserving the local similarity structure between different graph instances but fail to discover the global semantic structure of the entire data set. In this paper, we propose a unified framework called Local-instance and Global-semantic Learning (GraphLoG) for self-supervised whole-graph representation learning. Specifically, besides preserving the local similarities, GraphLoG introduces the hierarchical prototypes to capture the global semantic clusters. An efficient online expectation-maximization (EM) algorithm is further developed for learning the model. We evaluate GraphLoG by pre-training it on massive unlabeled graphs followed by fine-tuning on downstream tasks. Extensive experiments on both chemical and biological benchmark data sets demonstrate the effectiveness of the proposed approach.
Code (1)
Tasks
Graph Representation LearningRepresentation LearningSimilar Papers 제목 키워드 기반
RGI : Regularized Graph Infomax for self-supervised learning on graphs
Self-supervised learning is gaining considerable attention as a solution to avoid the requirement of extensive annotations in representation learning on graphs. We introduce \textit{Regularized Graph Infomax (RGI)}, a si…
Graph Neural NetworkRepresentation LearningSelf-Supervised LearningOmni-Granular Ego-Semantic Propagation for Self-Supervised Graph Representation Learning
Unsupervised/self-supervised graph representation learning is critical for downstream node- and graph-level classification tasks. Global structure of graphs helps discriminating representations and existing methods mainl…
Graph Representation LearningRepresentation LearningGL-Disen: Global-Local disentanglement for unsupervised learning of graph-level representations
Graph-level representation learning plays a crucial role in a variety of tasks such as molecular property prediction and community analysis. Currently, several models based on mutual information maximization have shown s…
DisentanglementGraph Representation LearningMolecular Property PredictionProperty Prediction+1Pairwise Half-graph Discrimination: A Simple Graph-level Self-supervised Strategy for Pre-training Graph Neural Networks
Self-supervised learning has gradually emerged as a powerful technique for graph representation learning. However, transferable, generalizable, and robust representation learning on graph data still remains a challenge f…
Binary ClassificationGraph ClassificationGraph Neural NetworkGraph Representation Learning+2Geometry Contrastive Learning on Heterogeneous Graphs
Self-supervised learning (especially contrastive learning) methods on heterogeneous graphs can effectively get rid of the dependence on supervisory data. Meanwhile, most existing representation learning methods embed the…
Contrastive LearningNode ClassificationNode ClusteringRepresentation Learning+1