Careful Selection and Thoughtful Discarding: Graph Explicit Pooling Utilizing Discarded Nodes

• URL: http://arxiv.org/abs/2311.12644v1
• Date: Tue, 21 Nov 2023 14:44:51 GMT
• Title: Careful Selection and Thoughtful Discarding: Graph Explicit Pooling Utilizing Discarded Nodes
• Authors: Chuang Liu, Wenhang Yu, Kuang Gao, Xueqi Ma, Yibing Zhan, Jia Wu, Bo Du, Wenbin Hu
• Abstract summary: We introduce a novel Graph Explicit Pooling (GrePool) method, which selects nodes by explicitly leveraging the relationships between the nodes and final representation vectors crucial for classification. We conduct comprehensive experiments across 12 widely used datasets to validate our proposed method's effectiveness.
• Score: 53.08068729187698
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph pooling has been increasingly recognized as crucial for Graph Neural Networks (GNNs) to facilitate hierarchical graph representation learning. Existing graph pooling methods commonly consist of two stages: selecting top-ranked nodes and discarding the remaining to construct coarsened graph representations. However, this paper highlights two key issues with these methods: 1) The process of selecting nodes to discard frequently employs additional Graph Convolutional Networks or Multilayer Perceptrons, lacking a thorough evaluation of each node's impact on the final graph representation and subsequent prediction tasks. 2) Current graph pooling methods tend to directly discard the noise segment (dropped) of the graph without accounting for the latent information contained within these elements. To address the first issue, we introduce a novel Graph Explicit Pooling (GrePool) method, which selects nodes by explicitly leveraging the relationships between the nodes and final representation vectors crucial for classification. The second issue is addressed using an extended version of GrePool (i.e., GrePool+), which applies a uniform loss on the discarded nodes. This addition is designed to augment the training process and improve classification accuracy. Furthermore, we conduct comprehensive experiments across 12 widely used datasets to validate our proposed method's effectiveness, including the Open Graph Benchmark datasets. Our experimental results uniformly demonstrate that GrePool outperforms 14 baseline methods for most datasets. Likewise, implementing GrePool+ enhances GrePool's performance without incurring additional computational costs.

Related papers

• Diversified Node Sampling based Hierarchical Transformer Pooling for Graph Representation Learning [15.248591535696146]
  node dropping pooling aims at exploiting learnable scoring functions to drop nodes with comparatively lower significance scores. Existing methods struggle to capture long-range dependencies since they mainly take GNNs as the backbones. We propose a Graph Transformer Pooling method termed GTPool to efficiently capture long-range pairwise interactions.
  arXiv  Detail & Related papers  (2023-10-31T08:13:21Z)
• MPool: Motif-Based Graph Pooling [0.0]
  Graph Neural networks (GNNs) have recently become a powerful technique for many graph-related tasks including graph classification. We propose a multi-channel Motif-based Graph Pooling method named (MPool) As the first channel, we develop node selection-based graph pooling by designing a node ranking model considering the motif adjacency of nodes. As the second channel, we develop cluster-based graph pooling by designing a spectral clustering model using motif adjacency. As the final layer, the result of each channel is aggregated into the final graph representation.
  arXiv  Detail & Related papers  (2023-03-07T05:21:15Z)
• 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)
• Edge but not Least: Cross-View Graph Pooling [76.71497833616024]
  This paper presents a cross-view graph pooling (Co-Pooling) method to better exploit crucial graph structure information. Through cross-view interaction, edge-view pooling and node-view pooling seamlessly reinforce each other to learn more informative graph-level representations.
  arXiv  Detail & Related papers  (2021-09-24T08:01:23Z)
• Accurate Learning of Graph Representations with Graph Multiset Pooling [45.72542969364438]
  We propose a Graph Multiset Transformer (GMT) that captures the interaction between nodes according to their structural dependencies. Our experimental results show that GMT significantly outperforms state-of-the-art graph pooling methods on graph classification benchmarks.
  arXiv  Detail & Related papers  (2021-02-23T07:45:58Z)
• Second-Order Pooling for Graph Neural Networks [62.13156203025818]
  We propose to use second-order pooling as graph pooling, which naturally solves the above challenges. We show that direct use of second-order pooling with graph neural networks leads to practical problems. We propose two novel global graph pooling methods based on second-order pooling; namely, bilinear mapping and attentional second-order pooling.
  arXiv  Detail & Related papers  (2020-07-20T20:52:36Z)
• 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)
• Structure-Feature based Graph Self-adaptive Pooling [65.4188800835203]
  We propose a novel graph self-adaptive pooling method to deal with graph data. Our method is effective in graph classification and outperforms state-of-the-art graph pooling methods.
  arXiv  Detail & Related papers  (2020-01-30T13:58:49Z)

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.