Methods › Graphs › Graph Models › DGCNN

Deep Graph Convolutional Neural Network

DGCNN

49 papers tagged archive 2025-07-28

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

DGCNN involves neural networks that read the graphs directly and learn a classification function. There are two main challenges: 1) how to extract useful features characterizing the rich information encoded in a graph for classification purpose, and 2) how to sequentially read a graph in a meaningful and consistent order. To address the first challenge, we design a localized graph convolution model and show its connection with two graph kernels. To address the second challenge, we design a novel SortPooling layer which sorts graph vertices in a consistent order so that traditional neural networks can be trained on the graphs.

Description and image from: An End-to-End Deep Learning Architecture for Graph Classification

Source: An End-to-End Deep Learning Architecture for Graph Classification

In Syntology the paper matched by title, arXiv:1712.03563, held, no code (no_code; paper_only). The lookup matched a paper by its title, arXiv:1712.03563, not a method entry. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:1712.03563) is about this method is not checked; it does not say whether this method has code.

Origin paper of this answer, arXiv:1712.03563 (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: 49 · with a code link: 26 · where Syntology ran a sample: 8 (8 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 (8 of 49 tagged: 8 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 49 of 49, 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

20 shown of 81 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
Point Cloud Classification8
3D Point Cloud Classification6
Autonomous Driving5
Adversarial Attack4
Graph Neural Network4
Adversarial Robustness3
Classification3
Decision Making3
Knowledge Distillation3
Object3
Self-Supervised Learning3
Semantic Segmentation3
3D Shape Classification2
Data Augmentation2
EEG2
Edge-computing2
GPU2
Neural Architecture Search2
Object Detection2
Object Recognition2

Usage over time archive 2025-07-28

Papers per year tagged with DGCNN: 2018 to 2025, peak 13 13 0 2018: 2 papers 2018 2019: 2 papers 2019 2020: 3 papers 2020 2021: 9 papers 2021 2022: 13 papers 2022 2023: 7 papers 2023 2024: 9 papers 2024 2025: 4 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (49 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