HCL: Improving Graph Representation with Hierarchical Contrastive Learning

by   Jun Wang, et al.

Contrastive learning has emerged as a powerful tool for graph representation learning. However, most contrastive learning methods learn features of graphs with fixed coarse-grained scale, which might underestimate either local or global information. To capture more hierarchical and richer representation, we propose a novel Hierarchical Contrastive Learning (HCL) framework that explicitly learns graph representation in a hierarchical manner. Specifically, HCL includes two key components: a novel adaptive Learning to Pool (L2Pool) method to construct more reasonable multi-scale graph topology for more comprehensive contrastive objective, a novel multi-channel pseudo-siamese network to further enable more expressive learning of mutual information within each scale. Comprehensive experimental results show HCL achieves competitive performance on 12 datasets involving node classification, node clustering and graph classification. In addition, the visualization of learned representation reveals that HCL successfully captures meaningful characteristics of graphs.


page 1

page 2

page 3

page 4


Unsupervised Hierarchical Graph Representation Learning by Mutual Information Maximization

Graph representation learning based on graph neural networks (GNNs) can ...

Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning

Graph representation learning plays a vital role in processing graph-str...

An Adaptive Contrastive Learning Model for Spike Sorting

Brain-computer interfaces (BCIs), is ways for electronic devices to comm...

Clustering by Maximizing Mutual Information Across Views

We propose a novel framework for image clustering that incorporates join...

Graph Representation Learning via Contrasting Cluster Assignments

With the rise of contrastive learning, unsupervised graph representation...

Group Contrastive Self-Supervised Learning on Graphs

We study self-supervised learning on graphs using contrastive methods. A...

Graph Pooling via Coarsened Graph Infomax

Graph pooling that summaries the information in a large graph into a com...

Please sign up or login with your details

Forgot password? Click here to reset