SimPool: Towards Topology Based Graph Pooling with Structural Similarity Features

• URL: http://arxiv.org/abs/2006.02244v1
• Date: Wed, 3 Jun 2020 12:51:57 GMT
• Title: SimPool: Towards Topology Based Graph Pooling with Structural Similarity Features
• Authors: Yaniv Shulman
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Deep learning methods for graphs have seen rapid progress in recent years with much focus awarded to generalising Convolutional Neural Networks (CNN) to graph data. CNNs are typically realised by alternating convolutional and pooling layers where the pooling layers subsample the grid and exchange spatial or temporal resolution for increased feature dimensionality. Whereas the generalised convolution operator for graphs has been studied extensively and proven useful, hierarchical coarsening of graphs is still challenging since nodes in graphs have no spatial locality and no natural order. This paper proposes two main contributions, the first is a differential module calculating structural similarity features based on the adjacency matrix. These structural similarity features may be used with various algorithms however in this paper the focus and 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. This is achieved by linking the concept of network reduction by means of structural similarity in graphs with the concept of hierarchical localised pooling. Experimental results demonstrate that as part of an end-to-end Graph Neural Network architecture SimPool calculates node cluster assignments that functionally resemble more to the locality preserving pooling operations used by CNNs that operate on local receptive fields in the standard grid. Furthermore the experimental results demonstrate that these features are useful in inductive graph classification tasks with no increase to the number of parameters.

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)
• SSHPool: The Separated Subgraph-based Hierarchical Pooling [47.78745802682822]
  We develop a novel local graph pooling method, namely the Separated Subgraph-based Hierarchical Pooling (SSH) for graph classification. We individually employ the local graph convolution units as the local structure to further compress each subgraph into a coarsened node. We develop an end-to-end GNN framework associated with the SSHPool module for graph classification.
  arXiv  Detail & Related papers  (2024-03-24T13:03:35Z)
• 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)
• Fuzzy Pooling [7.6146285961466]
  Convolutional Neural Networks (CNNs) are artificial learning systems typically based on two operations: convolution and pooling. We present a novel pooling operation based on (type-1) fuzzy sets to cope with the local imprecision of the feature maps. Experiments using publicly available datasets show that the proposed approach can enhance the classification performance of a CNN.
  arXiv  Detail & Related papers  (2022-02-12T11:18:32Z)
• Distribution Knowledge Embedding for Graph Pooling [32.78414015096222]
  We argue what is crucial to graph-level downstream tasks includes not only the topological structure but also the distribution from which nodes are sampled. powered by existing Graph Neural Networks (GNN), we propose a new plug-and-play pooling module, termed as Distribution Knowledge Embedding (DKEPool) A DKEPool network de facto disassembles representation learning into two stages, structure learning and distribution learning.
  arXiv  Detail & Related papers  (2021-09-29T10:36:12Z)
• Pyramidal Reservoir Graph Neural Network [18.632681846787246]
  We propose a deep Graph Neural Network (GNN) model that alternates two types of layers. We show how graph pooling can reduce the computational complexity of the model. Our proposed approach to the design of RC-based GNNs offers an advantageous and principled trade-off between accuracy and complexity.
  arXiv  Detail & Related papers  (2021-04-10T08:34:09Z)
• 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)
• Graph Neural Networks with Composite Kernels [60.81504431653264]
  We re-interpret node aggregation from the perspective of kernel weighting. We present a framework to consider feature similarity in an aggregation scheme. We propose feature aggregation as the composition of the original neighbor-based kernel and a learnable kernel to encode feature similarities in a feature space.
  arXiv  Detail & Related papers  (2020-05-16T04:44:29Z)
• Graphon Pooling in Graph Neural Networks [169.09536309161314]
  Graph neural networks (GNNs) have been used effectively in different applications involving the processing of signals on irregular structures modeled by graphs. We propose a new strategy for pooling and sampling on GNNs using graphons which preserves the spectral properties of the graph.
  arXiv  Detail & Related papers  (2020-03-03T21:04:20Z)

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.