Graph Pooling with Node Proximity for Hierarchical Representation Learning
Graph neural networks have attracted wide attentions to enable representation learning of graph data in recent works. In complement to graph convolution operators, graph pooling is crucial for extracting hierarchical representation of graph data. However, most recent graph pooling methods still fail to efficiently exploit the geometry of graph data. In this paper, we propose a novel graph pooling strategy that leverages node proximity to improve the hierarchical representation learning of graph data with their multi-hop topology. Node proximity is obtained by harmonizing the kernel representation of topology information and node features. Implicit structure-aware kernel representation of topology information allows efficient graph pooling without explicit eigendecomposition of the graph Laplacian. Similarities of node signals are adaptively evaluated with the combination of the affine transformation and kernel trick using the Gaussian RBF function. Experimental results demonstrate that the proposed graph pooling strategy is able to achieve state-of-the-art performance on a collection of public graph classification benchmark datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph ClassificationRepresentation LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
LiftPool: Lifting-based Graph Pooling for Hierarchical Graph Representation Learning
Graph pooling has been increasingly considered for graph neural networks (GNNs) to facilitate hierarchical graph representation learning. Existing graph pooling methods commonly consist of two stages, i.e., selecting the…
Graph ClassificationGraph Representation LearningRepresentation LearningGraph Convolutional Networks with EigenPooling
Graph neural networks, which generalize deep neural network models to graph structured data, have attracted increasing attention in recent years. They usually learn node representations by transforming, propagating and a…
ClassificationGeneral ClassificationGraph ClassificationGraph Neural Network+4Accurate Learning of Graph Representations with Graph Multiset Pooling
Graph neural networks have been widely used on modeling graph data, achieving impressive results on node classification and link prediction tasks. Yet, obtaining an accurate representation for a graph further requires a …
Graph ClassificationGraph ClusteringGraph EmbeddingGraph Generation+3ENADPool: The Edge-Node Attention-based Differentiable Pooling for Graph Neural Networks
Graph Neural Networks (GNNs) are powerful tools for graph classification. One important operation for GNNs is the downsampling or pooling that can learn effective embeddings from the node representations. In this paper, …
Graph ClassificationHierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling
In graph neural networks (GNNs), pooling operators compute local summaries of input graphs to capture their global properties, and they are fundamental for building deep GNNs that learn hierarchical representations. In t…
Graph ClassificationRepresentation Learning