On Exploring Node-feature and Graph-structure Diversities for Node Drop Graph Pooling

• URL: http://arxiv.org/abs/2306.12726v1
• Date: Thu, 22 Jun 2023 08:02:01 GMT
• Title: On Exploring Node-feature and Graph-structure Diversities for Node Drop Graph Pooling
• Authors: Chuang Liu, Yibing Zhan, Baosheng Yu, Liu Liu, Bo Du, Wenbin Hu, Tongliang Liu
• Abstract summary: Current node drop pooling methods ignore the graph diversity in terms of the node features and the graph structures, thus resulting in suboptimal graph-level representations. We propose a novel plug-and-play score scheme and refer to it as MID, which consists of a textbfMulti score space with two operations, textiti.e., fltextbfIpscore and textbfDropscore. Specifically, the multidimensional score space depicts the significance of nodes through multiple criteria; the flipscore encourages the maintenance of dissimilar node
• Score: 86.65151066870739
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A pooling operation is essential for effective graph-level representation learning, where the node drop pooling has become one mainstream graph pooling technology. However, current node drop pooling methods usually keep the top-k nodes according to their significance scores, which ignore the graph diversity in terms of the node features and the graph structures, thus resulting in suboptimal graph-level representations. To address the aforementioned issue, we propose a novel plug-and-play score scheme and refer to it as MID, which consists of a \textbf{M}ultidimensional score space with two operations, \textit{i.e.}, fl\textbf{I}pscore and \textbf{D}ropscore. Specifically, the multidimensional score space depicts the significance of nodes through multiple criteria; the flipscore encourages the maintenance of dissimilar node features; and the dropscore forces the model to notice diverse graph structures instead of being stuck in significant local structures. To evaluate the effectiveness of our proposed MID, we perform extensive experiments by applying it to a wide variety of recent node drop pooling methods, including TopKPool, SAGPool, GSAPool, and ASAP. Specifically, the proposed MID can efficiently and consistently achieve about 2.8\% average improvements over the above four methods on seventeen real-world graph classification datasets, including four social datasets (IMDB-BINARY, IMDB-MULTI, REDDIT-BINARY, and COLLAB), and thirteen biochemical datasets (D\&D, PROTEINS, NCI1, MUTAG, PTC-MR, NCI109, ENZYMES, MUTAGENICITY, FRANKENSTEIN, HIV, BBBP, TOXCAST, and TOX21). Code is available at~\url{https://github.com/whuchuang/mid}.

Related papers

• Careful Selection and Thoughtful Discarding: Graph Explicit Pooling Utilizing Discarded Nodes [53.08068729187698]
  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.
  arXiv  Detail & Related papers  (2023-11-21T14:44:51Z)
• 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)
• Multi-Granularity Graph Pooling for Video-based Person Re-Identification [14.943835935921296]
  graph neural networks (GNNs) are introduced to aggregate temporal and spatial features of video samples. Existing graph-based models, like STGCN, perform the textitmean/textitmax pooling on node features to obtain the graph representation. We propose the graph pooling network (GPNet) to learn the multi-granularity graph representation for the video retrieval.
  arXiv  Detail & Related papers  (2022-09-23T13:26:05Z)
• 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)
• Inverse Graph Identification: Can We Identify Node Labels Given Graph Labels? [89.13567439679709]
  Graph Identification (GI) has long been researched in graph learning and is essential in certain applications. This paper defines a novel problem dubbed Inverse Graph Identification (IGI) We propose a simple yet effective method that makes the node-level message passing process using Graph Attention Network (GAT) under the protocol of GI.
  arXiv  Detail & Related papers  (2020-07-12T12:06:17Z)
• 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.