Methods › Graphs › Graph Models › PGC-DGCNN

PGC-DGCNN

1 paper tagged archive 2025-07-28

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

PGC-DGCNN provides a new definition of graph convolutional filter. It generalizes the most commonly adopted filter, adding an hyper-parameter controlling the distance of the considered neighborhood. The model extends graph convolutions, following an intuition derived from the well-known convolutional filters over multi-dimensional tensors. The methods involves a simple, efficient and effective way to introduce a hyper-parameter on graph convolutions that influences the filter size, i.e. its receptive field over the considered graph.

Description and image from: On Filter Size in Graph Convolutional Networks

Source: On Filter Size in Graph Convolutional Networks

Papers archive 2025-07-28

1 shown of 1, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.

Tasks archive 2025-07-28

The archive attaches no task to a paper tagged with this method.

Usage over time archive 2025-07-28

Papers per year tagged with PGC-DGCNN: 2018 to 2018, peak 1 1 0 2018: 1 paper 2018
Papers per year the archive tags with this method, by the paper's archive date (1 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