简介

   Graph pooling plays an indispensable role in graph representation learning by aggregating the node representations on the graph into a compact form. However, the existing graph pooling models based on mutual information maximization all need to construct negative samples and usually only consider local neighborhood information. In this paper, we propose a novel coarsening graph infomax pooling method called SSPool, which selects the most informative subset of nodes as the pooled graph by neural estimation of the mutual information between the coarsened graph and the augmented coarsening graph. To maximize the neural estimation of mutual information, we propose a self-attention-based top-k method to learn the coarsened graph, while we use edge perturbation to augment the coarsened graph and a simple Siamese network framework to help the coarsened graph to get a better representation. Extensive experimental results show that our method outperforms previous state-of-the-art methods on eight benchmark data sets.

full paper