SSHPool: The Separated Subgraph-based Hierarchical Pooling
- URL: http://arxiv.org/abs/2403.16133v1
- Date: Sun, 24 Mar 2024 13:03:35 GMT
- Title: SSHPool: The Separated Subgraph-based Hierarchical Pooling
- Authors: Zhuo Xu, Lixin Cui, Yue Wang, Hangyuan Du, Lu Bai, Edwin R. Hancock,
- Abstract summary: We develop a novel local graph pooling method, namely the Separated Subgraph-based Hierarchical Pooling (SSHPool) for graph classification.
We individually employ a local graph convolution units as the local structure to compress each subgraph into a coarsened node.
By hierarchically performing the proposed procedures on the resulting coarsened graph, the proposed SSHPool can effectively extract the hierarchical global feature of the original graph structure.
- Score: 20.464546994653514
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper, we develop a novel local graph pooling method, namely the Separated Subgraph-based Hierarchical Pooling (SSHPool), for graph classification. To this end, we commence by assigning the nodes of a sample graph into different clusters, resulting in a family of separated subgraphs. We individually employ a 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 arising 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 feature of the original graph structure, encapsulating rich intrinsic structural characteristics. Furthermore, we develop an end-to-end GNN framework associated with the proposed SSHPool module for graph classification. Experimental results demonstrate the superior performance of the proposed model on real-world datasets, significantly outperforming state-of-the-art GNN methods in terms of the classification accuracies.
Related papers
- Graph Pooling via Ricci Flow [1.1126342180866644]
We introduce a graph pooling operator (ORC-Pool) which utilizes a characterization of the graph's geometry via Ollivier's discrete Ricci curvature and an associated geometric flow.
ORC-Pool extends such clustering approaches to attributed graphs, allowing for the integration of geometric coarsening into Graph Neural Networks as a pooling layer.
arXiv Detail & Related papers (2024-07-05T03:26:37Z) - SPGNN: Recognizing Salient Subgraph Patterns via Enhanced Graph Convolution and Pooling [25.555741218526464]
Graph neural networks (GNNs) have revolutionized the field of machine learning on non-Euclidean data such as graphs and networks.
We propose a concatenation-based graph convolution mechanism that injectively updates node representations.
We also design a novel graph pooling module, called WL-SortPool, to learn important subgraph patterns in a deep-learning manner.
arXiv Detail & Related papers (2024-04-21T13:11:59Z) - Graph Parsing Networks [64.5041886737007]
We propose an efficient graph parsing algorithm to infer the pooling structure, which then drives graph pooling.
The resulting Graph Parsing Network (GPN) adaptively learns personalized pooling structure for each individual graph.
arXiv Detail & Related papers (2024-02-22T09:08:36Z) - Deep Graph Neural Networks via Flexible Subgraph Aggregation [50.034313206471694]
Graph neural networks (GNNs) can learn from graph-structured data and learn the representation of nodes through aggregating neighborhood information.
In this paper, we evaluate the expressive power of GNNs from the perspective of subgraph aggregation.
We propose a sampling-based node-level residual module (SNR) that can achieve a more flexible utilization of different hops of subgraph aggregation.
arXiv Detail & Related papers (2023-05-09T12:03:42Z) - Higher-order Clustering and Pooling for Graph Neural Networks [77.47617360812023]
Graph Neural Networks achieve state-of-the-art performance on a plethora of graph classification tasks.
HoscPool is a clustering-based graph pooling operator that captures higher-order information hierarchically.
We evaluate HoscPool on graph classification tasks and its clustering component on graphs with ground-truth community structure.
arXiv Detail & Related papers (2022-09-02T09:17:10Z) - LiftPool: Lifting-based Graph Pooling for Hierarchical Graph
Representation Learning [53.176603566951016]
We propose an enhanced three-stage method via lifting, named LiftPool, to improve hierarchical graph representation.
For each node to be removed, its local information is obtained by subtracting the global information aggregated from its neighboring preserved nodes.
Evaluations on benchmark graph datasets show that LiftPool substantially outperforms the state-of-the-art graph pooling methods in the task of graph classification.
arXiv Detail & Related papers (2022-04-27T12:38:02Z) - Structure-Aware Hierarchical Graph Pooling using Information Bottleneck [2.7088996845250897]
Graph pooling is an essential ingredient of Graph Neural Networks (GNNs) in graph classification and regression tasks.
We propose a novel pooling method named as HIBPool where we leverage the Information Bottleneck (IB) principle.
We also introduce a novel structure-aware Discriminative Pooling Readout (DiP-Readout) function to capture the informative local subgraph structures in the graph.
arXiv Detail & Related papers (2021-04-27T07:27:43Z) - CommPOOL: An Interpretable Graph Pooling Framework for Hierarchical
Graph Representation Learning [74.90535111881358]
We propose a new interpretable graph pooling framework - CommPOOL.
It can capture and preserve the hierarchical community structure of graphs in the graph representation learning process.
CommPOOL is a general and flexible framework for hierarchical graph representation learning.
arXiv Detail & Related papers (2020-12-10T21:14:18Z) - Graph Pooling with Node Proximity for Hierarchical Representation
Learning [80.62181998314547]
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.
Results show that the proposed graph pooling strategy is able to achieve state-of-the-art performance on a collection of public graph classification benchmark datasets.
arXiv Detail & Related papers (2020-06-19T13:09:44Z) - SimPool: Towards Topology Based Graph Pooling with Structural Similarity
Features [0.0]
This paper proposes two main contributions, the first is a differential module calculating structural similarity features based on the adjacency matrix.
The second main contribution is on integrating these features with a revisited pooling layer DiffPool arXiv:1806.08804 to propose a pooling layer referred to as SimPool.
Experimental results demonstrate that as part of an end-to-end Graph Neural Network architecture SimPool calculates node cluster assignments that resemble more to the locality.
arXiv Detail & Related papers (2020-06-03T12:51:57Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.