Methods › Graphs › Graph Models › Cluster-GCN

Cluster-GCN

3 papers tagged archive 2025-07-28

Introduced by Wei-Lin Chiang et al. in Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Cluster-GCN is a novel GCN algorithm that is suitable for SGD-based training by exploiting the graph clustering structure. Cluster-GCN works as the following: at each step, it samples a block of nodes that associate with a dense subgraph identified by a graph clustering algorithm, and restricts the neighborhood search within this subgraph. This simple but effective strategy leads to significantly improved memory and computational efficiency while being able to achieve comparable test accuracy with previous algorithms.

Description and image from: Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks

PaperSource

In Syntology repository known, no verified implementation (declared_code; repositories: 6 listed of 6 in the graph, strongest link: official). The lookup matched a paper by its title, arXiv:1905.07953, not a method entry. This answer is about arXiv:1905.07953, the paper the archive credits with this method.

Origin paper of this answer, arXiv:1905.07953 (its page on this site · its page on Syntology).

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 3 · with a code link: 3 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (1 of 3 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 3 of 3, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

12 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Clustering2
Graph Learning2
Node Classification2
Computational Efficiency1
Face Clustering1
Graph Clustering1
Graph Neural Network1
Link Prediction1
Node Property Prediction1
image-classification1
imbalanced classification1
whole slide images1

Usage over time archive 2025-07-28

Papers per year tagged with Cluster-GCN: 2019 to 2022, peak 1 1 0 2019: 1 paper 2019 2020: 0 papers 2020 2021: 1 paper 2021 2022: 1 paper 2022
Papers per year the archive tags with this method, by the paper's archive date (3 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Graph Models

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections