Graph Pooling by Local Cluster Selection

Yizhu Chen
11/25/2024
cs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Graph pooling is a family of operations which take graphs as input and produce shrinked graphs as output. Modern graph pooling methods are trainable and, in general inserted in Graph Neural Networks (GNNs) architectures as graph shrinking operators along the (deep) processing pipeline. This work proposes a novel procedure for pooling graphs, along with a node-centred graph pooling operator.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Edge-Based Graph Component Pooling

86% match2024

Graph Parsing Networks

86% match1 repo102026

Geometry-Aware Edge Pooling for Graph Neural Networks

86% match1 repo72025

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

85% match2023

BN-Pool: a Bayesian Nonparametric Approach to Graph Pooling

84% match1 repo152025

A Comprehensive Graph Pooling Benchmark: Effectiveness, Robustness and Generalizability

84% match1 repo122024

Cite this paper

@article{chen2024graph,
  title  = {Graph Pooling by Local Cluster Selection},
  author = {Yizhu Chen},
  year   = {2024},
  eprint = {2411.16615},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.16615v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.16615.svg)](https://codeofpaper.com/paper/2411.16615)

Discussion