The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
An End-to-End Deep Learning Architecture for Graph Classification
Open accessAbstract
Neural networks are typically designed to deal with data in tensor forms. In this paper, we propose a novel neural network architecture accepting graphs of arbitrary structure. Given a dataset containing graphs in the form of (G,y) where G is a graph and y is its class, we aim to develop 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. Experiments on benchmark graph classification datasets demonstrate that the proposed architecture achieves highly competitive performance with state-of-the-art graph kernels and other graph neural network methods. Moreover, the architecture allows end-to-end gradient-based training with original graphs, without the need to first transform graphs into vectors.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
Libsvm : A library for support vector machines
Ferrari, V. (2008) · Medical Entomology and Zoology · Cited by 10,122
The graph neural network model
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005605 · Cited by 9,582
Playing Atari with Deep Reinforcement Learning
Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., & Riedmiller, M. (2013) · arXiv · doi:10.48550/arxiv.1312.5602 · Cited by 9,471
Advances In Deep Learning On Graphs (Gsp'18 Workshop)
Defferrard, M. (2016) · Figshare · doi:10.5281/zenodo.1286817 · Cited by 4,613
Spectral Networks and Locally Connected Networks on Graphs
Bruna, J., Zaremba, W., Szlam, A., & LeCun, Y. (2013) · arXiv · doi:10.48550/arxiv.1312.6203 · Cited by 3,983
Convolutional Networks on Graphs for Learning Molecular Fingerprints
Duvenaud, D., Maclaurin, D., Aguilera-Iparraguirre, J., Gómez-Bombarelli, R., Hirzel, T., Aspuru-Guzik, A., & Adams, R. P. (2015) · arXiv · doi:10.48550/arxiv.1509.09292 · Cited by 2,628
Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering
Defferrard, M., Bresson, X., & Vandergheynst, P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.09375 · Cited by 1,673
Weisfeiler-Lehman Graph Kernels
Shervashidze, N., Schweitzer, P., van Leeuwen, E. J., Mehlhorn, K., & Borgwardt, K. M. (2010) · Max Planck Digital Library · Cited by 1,644
Practical graph isomorphism, II
McKay, B. D., & Piperno, A. (2014) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2013.09.003 · Cited by 1,597
Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs
Simonovsky, M., & Komodakis, N. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.11 · Cited by 1,266
Deep Convolutional Networks on Graph-Structured Data
Henaff, M., Bruna, J., & LeCun, Y. (2015) · arXiv · doi:10.48550/arxiv.1506.05163 · Cited by 1,255
Torch7: A Matlab-like Environment for Machine Learning
Collobert, R., Kavukcuoglu, K., & Farabet, C. (2011) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 1,186
Convolution kernels on discrete structures
Haussler, D. H. (1999) · Cited by 1,089
Shortest-Path Kernels on Graphs
Borgwardt, K. M., & Kriegel, H. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.132 · Cited by 837
Learning Convolutional Neural Networks for Graphs
Niepert, M., Ahmed, M. M., & Kutzkov, K. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.05273 · Cited by 775
Efficient Graphlet Kernels for Large Graph Comparison
Sherashidze, N., Vishwanathan, S. V. N., Petri, T., Mehlhorn, K., & Borgwardt, K. M. (2009) · MPG.PuRe (Max Planck Society) · Cited by 644
Diffusion-Convolutional Neural Networks
Atwood, J. R., & Towsley, D. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.02136 · Cited by 476
Multi-Scale Convolutional Neural Networks for Time Series Classification
Cui, Z., Chen, W., & Chen, Y. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.06995 · Cited by 455
Self-citationDiscriminative Embeddings of Latent Variable Models for Structured Data
Dai, H., Dai, B., & Song, L. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.05629 · Cited by 454
Efficient Graphlet Kernels for Large Graph Comparison
Shervashidze, N., Vishwanathan, S. V. N., Petri, T. H., Mehlhorn, K., Borgwardt, K. M., Dyk, D. V., & Welling, M. (2009) · Cited by 394
Propagation kernels: efficient graph kernels from propagated information
Neumann, M., Garnett, R., Bauckhage, C., & Kersting, K. (2016) · Machine Learning · doi:10.1007/s10994-015-5517-9 · Cited by 229
Self-citationDeriving Neural Architectures from Sequence and Graph KernelsPreprint
Lei, T., Jin, W., Barzilay, R., & Jaakkola, T. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.09037 · Cited by 154
The Multiscale Laplacian Graph KernelPreprint
Kondor, R., & Pan, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.06186 · Cited by 135
On Valid Optimal Assignment Kernels and Applications to Graph ClassificationPreprint
Kriege, N. M., Giscard, P.-L., & Wilson, R. C. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.01141 · Cited by 125
Efficient Graph Kernels by Randomization
Neumann, M., Patricia, N., Garnett, R., & Kersting, K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33460-3_30 · Cited by 52
Self-citationAn Aligned Subtree Kernel for Weighted Graphs
Bai, L., Rossi, L., Zhang, Z., & Hancock, E. R. (2015) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 41
Graph fibrations, graph isomorphism, and PageRank
Boldi, P., Lonati, V., Santini, M., & Vigna, S. (2006) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita:2006004 · Cited by 39
Global Weisfeiler-Lehman Graph KernelsPreprint
Morris, C., Kersting, K., & Mutzel, P. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.02379 · Cited by 6
Chen, T., Wang, Z., Li, L., Li, D., Li, Z., Chang, X., Bian, P., Liang, G., Wang, Q., & Xie, T. (2025) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2025.6
Cited by
A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2978386 · Cited by 11,000
Graph neural networks: A review of methods and applications
Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., & Sun, M. (2020) · AI Open · doi:10.1016/j.aiopen.2021.01.001 · Cited by 6,880
Deep Learning on Graphs: A Survey
Zhang, Z., Cui, P., & Zhu, W. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.2981333 · Cited by 1,633
Simplifying Graph Convolutional Networks
Wu, F., Zhang, T., Junior, A. H. D. S., Fifty, C., Yu, T., & Weinberger, K. Q. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.07153 · Cited by 1,165
Fast Graph Representation Learning with PyTorch Geometric
Fey, M., & Lenssen, J. E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.02428 · Cited by 1,132
Metadata
- Authors
- Zhang, M., Cui, Z., Neumann, M., & Chen, Y.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2018-04-29
- Volume
- 32
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2788919350
- Cited by
- 1,461
- References
- 32
- FWCI
- 56.38
- Type
- conference paper
- Language
- en
- Open access
- diamond
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.