Cited by 638Advanced Graph Neural NetworksGraph Theory and AlgorithmsComplex Network Analysis Techniques

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

Large-Scale Learnable Graph Convolutional Networks

Open access
Gao, Hongyang, Wang, Zhengyang, Ji, Shuiwang·2018·Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining

Abstract

Convolutional neural networks (CNNs) have achieved great success on grid-like data such as images, but face tremendous challenges in learning from more generic data such as graphs. In CNNs, the trainable local filters enable the automatic extraction of high-level features. The computation with filters requires a fixed number of ordered units in the receptive fields. However, the number of neighboring units is neither fixed nor are they ordered in generic graphs, thereby hindering the applications of convolutional operations. Here, we address these challenges by proposing the learnable graph convolutional layer (LGCL). LGCL automatically selects a fixed number of neighboring nodes for each feature based on value ranking in order to transform graph data into grid-like structures in 1-D format, thereby enabling the use of regular convolutional operations on generic graphs. To enable model training on large-scale graphs, we propose a sub-graph training method to reduce the excessive memory and computational resource requirements suffered by prior methods on graph convolutions. Our experimental results on node classification tasks in both transductive and inductive learning settings demonstrate that our methods can achieve consistently better performance on the Cora, Citeseer, Pubmed citation network, and protein-protein interaction network datasets. Our results also indicate that the proposed methods using sub-graph training strategy are more efficient as compared to prior approaches.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3219819.3219947

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Flagged first, then by citations

Show all 9 references

Research works printed but not linked: 18

  1. Bahdanau Dzmitry, 2015, International Conference on Learning Representations
  2. Cho Kyunghyun, 2014, On the Properties of Neural Machine Translation: Encoder--Decoder Approaches. Syntax, Semantics and Structure in Statistical Translation
  3. Michaël Defferrard Xavier Bresson and Pierre Vandergheynst . 2016. Convolutional neural networks on graphs with fast localized spectral filtering Advances in Neural Information Processing Systems. 3844--3852. Michaël Defferrard Xavier Bresson and Pierre Vandergheynst . 2016. Convolutional neural networks on graphs with fast localized spectral filtering Advances in Neural Information Processing Systems. 3844--3852.
  4. Xavier Glorot and Yoshua Bengio . 2010. Understanding the difficulty of training deep feedforward neural networks Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics. 249--256. Xavier Glorot and Yoshua Bengio . 2010. Understanding the difficulty of training deep feedforward neural networks Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics. 249--256.
  5. William L. Hamilton Rex Ying and Jure Leskovec . 2017. Inductive Representation Learning on Large Graphs. In NIPS. William L. Hamilton Rex Ying and Jure Leskovec . 2017. Inductive Representation Learning on Large Graphs. In NIPS.
  6. 10.1109/CVPR.2016.90 · DOI · Paper page
  7. Huang Gao, 2017, IEEE Conference on Computer Vision and Pattern Recognition
  8. Kingma Diederik, 2015, The International Conference on Learning Representations
  9. Kipf Thomas N, 2017, International Conference on Learning Representations
  10. Krizhevsky Alex, Advances in Neural Information Processing Systems 25, bibfieldeditor
  11. Alex Krizhevsky Ilya Sutskever and Geoffrey E Hinton . 2012 b. Imagenet classification with deep convolutional neural networks Advances in neural information processing systems. 1097--1105. Alex Krizhevsky Ilya Sutskever and Geoffrey E Hinton . 2012 b. Imagenet classification with deep convolutional neural networks Advances in neural information processing systems. 1097--1105.
  12. Niepert Mathias, 2016, International Conference on Machine Learning. 2014--2023
  13. Karen Simonyan and Andrew Zisserman . 2015. Very deep convolutional networks for large-scale image recognition Proceedings of the International Conference on Learning Representations. Karen Simonyan and Andrew Zisserman . 2015. Very deep convolutional networks for large-scale image recognition Proceedings of the International Conference on Learning Representations.
  14. 10.5555/2627435.2670313 · DOI
  15. Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez Łukasz Kaiser and Illia Polosukhin . 2017. Attention is all you need. In Advances in Neural Information Processing Systems. 6000--6010. Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez Łukasz Kaiser and Illia Polosukhin . 2017. Attention is all you need. In Advances in Neural Information Processing Systems. 6000--6010.
  16. Velivcković Petar, 2017, Graph Attention Networks. arXiv preprint arXiv:1710.10903 · arXiv
  17. Wang Tao, 2012, 2012 21st International Conference on. IEEE, 3304--3308
  18. Yang Zhilin, 2016, International Conference on Machine Learning

Cited by

Sorted by citations

Items 601–637 of 637

Metadata

Authors
Gao, H., Wang, Z., & Ji, S.
Affiliations
Washington State University (US)
Venue
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
Publisher
ACM
Published
2018-07-19
Pages
1416-1424
OpenAlex
W2809418595
Cited by
638
References
9
Citations by year
2026: 20 · 2025: 67 · 2024: 72 · 2023: 79 · 2022: 100 · 2021: 140 · 2020: 110 · 2019: 46 · 2018: 4
FWCI
30.63
Type
conference paper
Language
en
Open access
Locations
  • ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Defense Advanced Research Projects Agency (N66001-17-2-4031)
  • National Science Foundation (DBI-1641223, IIS-1633359)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
Keywords
graph convolutional networks, large-scale graphs, node classification, value ranking, memory and computational efficiency

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review