SSHPool: The Separated Subgraph-based Hierarchical Pooling
In this paper, we develop a novel local graph pooling method, namely the Separated Subgraph-based Hierarchical Pooling (SSHPool), for graph classification. We commence by assigning the nodes of a sample graph into different clusters, resulting in a family of separated subgraphs. We individually employ the local graph convolution units as the local structure to further compress each subgraph into a coarsened node, transforming the original graph into a coarsened graph. Since these subgraphs are separated by different clusters and the structural information cannot be propagated between them, the local convolution operation can significantly avoid the over-smoothing problem caused by message passing through edges in most existing Graph Neural Networks (GNNs). By hierarchically performing the proposed procedures on the resulting coarsened graph, the proposed SSHPool can effectively extract the hierarchical global features of the original graph structure, encapsulating rich intrinsic structural characteristics. Furthermore, we develop an end-to-end GNN framework associated with the SSHPool module for graph classification. Experimental results demonstrate the superior performance of the proposed model on real-world datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Subgraph Attention for Node Classification and Hierarchical Graph Pooling
Graph neural networks have gained significant interest from the research community for both node classification within a graph and graph classification within a set of graphs. Attention mechanism applied on the neighborh…
ClassificationGraph ClassificationNode ClassificationHC-GAE: The Hierarchical Cluster-based Graph Auto-Encoder for Graph Representation Learning
Graph Auto-Encoders (GAEs) are powerful tools for graph representation learning. In this paper, we develop a novel Hierarchical Cluster-based GAE (HC-GAE), that can learn effective structural characteristics for graph da…
DecoderGraph ClassificationGraph Representation LearningNode Classification+1SUGAR: Subgraph Neural Network with Reinforcement Pooling and Self-Supervised Mutual Information Mechanism
Graph representation learning has attracted increasing research attention. However, most existing studies fuse all structural features and node attributes to provide an overarching view of graphs, neglecting finer substr…
Graph ClassificationGraph Neural NetworkGraph Representation LearningRepresentation LearningHierarchical Graph Pooling with Structure Learning
Graph Neural Networks (GNNs), which generalize deep neural networks to graph-structured data, have drawn considerable attention and achieved state-of-the-art performance in numerous graph related tasks. However, existing…
Graph ClassificationGraph Neural NetworkRepresentation LearningSoft-mask: Adaptive Substructure Extractions for Graph Neural Networks
For learning graph representations, not all detailed structures within a graph are relevant to the given graph tasks. Task-relevant structures can be $localized$ or $sparse$ which are only involved in subgraphs or charac…
Graph Neural NetworkRepresentation Learning