Graph learning· 2016
Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering
On the reading lists
- #192 in the Top 500 (2026 edition)
- #10 in Graph learning (2026 edition)
Why it matters
Introduced efficient localized spectral filters using Chebyshev polynomials.
Condensed from the expert lists' notes.
The record
- First released
- 2016 (from arXiv 1606.09375)
- Citations
- 8,971 citations, as counted by
Semantic Scholar (non-commercial licence) - Named by
- both expert lists
- Score
- 0.549 · computed rank 192 · consensus 0.84, must-read 0, citations percentile 0.848 (2010s · graphs), awards 0, existing lists 0. Method
Data sources
Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0), and
Semantic Scholar (used under its non-commercial API licence). Each count names its source. See the method.