Fetching the paper…
Reading the bibliography…
Deep learning has revolutionized many machine learning tasks in recent years, ranging from image classification and video processing to speech recognition and natural language understanding.
S. Pan, J. Wu, X. Zhu, C. Zhang, and Y. Wang, “Tri-party deep network representation,” in Proc. of IJCAI , 2016, pp. 1895–1901
1901
Earlier work this paper cites.
J. Bastings, I. Titov, W. Aziz, D. Marcheggiani, and K. Sima’an, “Graph convolutional encoders for syntax-aware neural machine translation,” in Proc. of EMNLP , 2017, pp. 1957–1967
1967
Earlier work this paper cites.
B. Weisfeiler and A. Lehman, “A reduction of a graph to a canonical form and an algebra arising during this reduction,” Nauchno-Technicheskaya Informatsia , vol. 2, no. 9, pp. 12–16, 1968
1968
Earlier work this paper cites.
K. Hornik, M. Stinchcombe, and H. White, “Multilayer feedforward networks are universal approximators,” Neural networks , vol. 2, no. 5, pp. 359–366, 1989
1989
Earlier work this paper cites.
A. K. Debnath, R. L. Lopez de Compadre, G. Debnath, A. J. Shusterman, and C. Hansch, “Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity,” Journal of medicinal chemistry , vol. 34, no. 2, pp. 786–797, 1991
1991
Earlier work this paper cites.
Y. LeCun, Y. Bengio et al. , “Convolutional networks for images, speech, and time series,” The handbook of brain theory and neural networks , vol. 3361, no. 10, p. 1995, 1995
1995
Earlier work this paper cites.
S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural computation , vol. 9, no. 8, pp. 1735–1780, 1997
1997
Earlier work this paper cites.
A. Sperduti and A. Starita, “Supervised neural networks for the classification of structures,” IEEE Transactions on Neural Networks , vol. 8, no. 3, pp. 714–735, 1997
1997
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, P. Haffner et al. , “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278–2324, 1998
1998
Earlier work this paper cites.
J. Atwood and D. Towsley, “Diffusion-convolutional neural networks,” in Proc. of NIPS , 2016, pp. 1993–2001
2001
Earlier work this paper cites.
P. D. Dobson and A. J. Doig, “Distinguishing enzyme structures from non-enzymes without alignments,” Journal of molecular biology , vol. 330, no. 4, pp. 771–783, 2003
2003
Earlier work this paper cites.
H. Toivonen, A. Srinivasan, R. D. King, S. Kramer, and C. Helma, “Statistical evaluation of the predictive toxicology challenge 2000–2001,” Bioinformatics , vol. 19, no. 10, pp. 1183–1193, 2003
2003
Earlier work this paper cites.
A. Micheli, D. Sona, and A. Sperduti, “Contextual processing of structured data by recursive cascade correlation,” IEEE Transactions on Neural Networks , vol. 15, no. 6, pp. 1396–1410, 2004
2004
Earlier work this paper cites.
M. Gori, G. Monfardini, and F. Scarselli, “A new model for learning in graph domains,” in Proc. of IJCNN , vol. 2. IEEE, 2005, pp. 729–734
2005
Earlier work this paper cites.
B. Hammer, A. Micheli, and A. Sperduti, “Universal approximation capability of cascade correlation for structures,” Neural Computation , vol. 17, no. 5, pp. 1109–1159, 2005
2005
Earlier work this paper cites.
K. M. Borgwardt, C. S. Ong, S. Schönauer, S. Vishwanathan, A. J. Smola, and H.-P. Kriegel, “Protein function prediction via graph kernels,” Bioinformatics , vol. 21, no. suppl_1, pp. i47–i56, 2005
2005
Earlier work this paper cites.
I. S. Dhillon, Y. Guan, and B. Kulis, “Weighted graph cuts without eigenvectors a multilevel approach,” IEEE transactions on pattern analysis and machine intelligence , vol. 29, no. 11, pp. 1944–1957, 2007
2007
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “Computational capabilities of graph neural networks,” IEEE Transactions on Neural Networks , vol. 20, no. 1, pp. 81–102, 2008
2008
Earlier work this paper cites.
P. Vincent, H. Larochelle, Y. Bengio, and P.-A. Manzagol, “Extracting and composing robust features with denoising autoencoders,” in Proc. of ICML . ACM, 2008, pp. 1096–1103
2008
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI magazine , vol. 29, no. 3, p. 93, 2008
2008
Earlier work this paper cites.
J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su, “Arnetminer: extraction and mining of academic social networks,” in Proc. of KDD . ACM, 2008, pp. 990–998
2008
Earlier work this paper cites.
N. Wale, I. A. Watson, and G. Karypis, “Comparison of descriptor spaces for chemical compound retrieval and classification,” Knowledge and Information Systems , vol. 14, no. 3, pp. 347–375, 2008
2008
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE Transactions on Neural Networks , vol. 20, no. 1, pp. 61–80, 2009
2009
Earlier work this paper cites.
A. Micheli, “Neural network for graphs: A contextual constructive approach,” IEEE Transactions on Neural Networks , vol. 20, no. 3, pp. 498–511, 2009
2009
Earlier work this paper cites.
L. Tang and H. Liu, “Relational learning via latent social dimensions,” in Proc. of KDD . ACM, 2009, pp. 817–826
2009
Earlier work this paper cites.
P. Vincent, H. Larochelle, I. Lajoie, Y. Bengio, and P.-A. Manzagol, “Stacked denoising autoencoders: Learning useful representations in a deep network with a local denoising criterion,” Journal of machine learning research , vol. 11, no. Dec, pp. 3371–3408, 2010
2010
Earlier work this paper cites.
C. Gallicchio and A. Micheli, “Graph echo state networks,” in IJCNN . IEEE, 2010, pp. 1–8
2010
Earlier work this paper cites.
S. V. N. Vishwanathan, N. N. Schraudolph, R. Kondor, and K. M. Borgwardt, “Graph kernels,” Journal of Machine Learning Research , vol. 11, no. Apr, pp. 1201–1242, 2010
2010
Earlier work this paper cites.
A. Carlson, J. Betteridge, B. Kisiel, B. Settles, E. R. Hruschka Jr, and T. M. Mitchell, “Toward an architecture for never-ending language learning.” in Proc. of AAAI , 2010, pp. 1306–1313
2010
Earlier work this paper cites.
N. Shervashidze, P. Schweitzer, E. J. v. Leeuwen, K. Mehlhorn, and K. M. Borgwardt, “Weisfeiler-lehman graph kernels,” Journal of Machine Learning Research , vol. 12, no. Sep, pp. 2539–2561, 2011
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
G. Hinton, L. Deng, D. Yu, G. E. Dahl, A.-r. Mohamed, N. Jaitly, A. Senior, V. Vanhoucke, P. Nguyen, T. N. Sainath et al. , “Deep neural networks for acoustic modeling in speech recognition: The shared views of four research groups,” IEEE Signal processing magazine , vol. 29, no. 6, pp. 82–97, 2012
2012
Earlier work this paper cites.
D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, “The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,” IEEE Signal Processing Magazine , vol. 30, no. 3, pp. 83–98, 2013
2013
Earlier work this paper cites.
A. Sandryhaila and J. M. Moura, “Discrete signal processing on graphs,” IEEE transactions on signal processing , vol. 61, no. 7, pp. 1644–1656, 2013
2013
Earlier work this paper cites.
J. Bruna, W. Zaremba, A. Szlam, and Y. LeCun, “Spectral networks and locally connected networks on graphs,” in Proc. of ICLR , 2014
2014
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proc. of KDD . ACM, 2014, pp. 701–710
2014
Earlier work this paper cites.
K. Cho, B. Van Merriënboer, C. Gulcehre, D. Bahdanau, F. Bougares, H. Schwenk, and Y. Bengio, “Learning phrase representations using rnn encoder-decoder for statistical machine translation,” in Proc. of EMNLP , 2014, pp. 1724–1734
2014
Earlier work this paper cites.
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” in Proc. of NIPS , 2014, pp. 2672–2680
2014
Earlier work this paper cites.
R. Ramakrishnan, P. O. Dral, M. Rupp, and O. A. Von Lilienfeld, “Quantum chemistry structures and properties of 134 kilo molecules,” Scientific data , vol. 1, p. 140022, 2014
2014
Earlier work this paper cites.
H. Jagadish, J. Gehrke, A. Labrinidis, Y. Papakonstantinou, J. M. Patel, R. Ramakrishnan, and C. Shahabi, “Big data and its technical challenges,” Communications of the ACM , vol. 57, no. 7, pp. 86–94, 2014
2014
Earlier work this paper cites.
S. Ren, K. He, R. Girshick, and J. Sun, “Faster r-cnn: Towards real-time object detection with region proposal networks,” in Proc. of NIPS , 2015, pp. 91–99
2015
Earlier work this paper cites.
M.-T. Luong, H. Pham, and C. D. Manning, “Effective approaches to attention-based neural machine translation,” in Proc. of EMNLP , 2015, pp. 1412–1421
2015
Earlier work this paper cites.
Y. Li, D. Tarlow, M. Brockschmidt, and R. Zemel, “Gated graph sequence neural networks,” in Proc. of ICLR , 2015
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
S. Chen, R. Varma, A. Sandryhaila, and J. Kovačević, “Discrete signal processing on graphs: Sampling theory,” IEEE Transactions on Signal Processing , vol. 63, no. 24, pp. 6510–6523, 2015
2015
Earlier work this paper cites.
D. K. Duvenaud, D. Maclaurin, J. Iparraguirre, R. Bombarell, T. Hirzel, A. Aspuru-Guzik, and R. P. Adams, “Convolutional networks on graphs for learning molecular fingerprints,” in Proc. of NIPS , 2015, pp. 2224–2232
2015
Earlier work this paper cites.
J. Masci, D. Boscaini, M. Bronstein, and P. Vandergheynst, “Geodesic convolutional neural networks on riemannian manifolds,” in Proc. of CVPR Workshops , 2015, pp. 37–45
2015
Earlier work this paper cites.
J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei, “Line: Large-scale information network embedding,” in WWW , 2015, pp. 1067–1077
2015
Earlier work this paper cites.
J. Redmon, S. Divvala, R. Girshick, and A. Farhadi, “You only look once: Unified, real-time object detection,” in Proc. of CVPR , 2016, pp. 779–788
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in Proc. of NIPS , 2016, pp. 3844–3852
2016
Earlier work this paper cites.
S. Cao, W. Lu, and Q. Xu, “Deep neural networks for learning graph representations,” in Proc. of AAAI , 2016, pp. 1145–1152
2016
Earlier work this paper cites.
D. Wang, P. Cui, and W. Zhu, “Structural deep network embedding,” in Proc. of KDD . ACM, 2016, pp. 1225–1234
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” NIPS Workshop on Bayesian Deep Learning , 2016
2016
Earlier work this paper cites.
A. Jain, A. R. Zamir, S. Savarese, and A. Saxena, “Structural-rnn: Deep learning on spatio-temporal graphs,” in Proc. of CVPR , 2016, pp. 5308–5317
2016
Earlier work this paper cites.
S. Pan, J. Wu, X. Zhu, C. Zhang, and P. S. Yu, “Joint structure feature exploration and regularization for multi-task graph classification,” IEEE Transactions on Knowledge and Data Engineering , vol. 28, no. 3, pp. 715–728, 2016
2016
Earlier work this paper cites.
S. Kearnes, K. McCloskey, M. Berndl, V. Pande, and P. Riley, “Molecular graph convolutions: moving beyond fingerprints,” Journal of computer-aided molecular design , vol. 30, no. 8, pp. 595–608, 2016
2016
Earlier work this paper cites.
D. Boscaini, J. Masci, E. Rodolà, and M. Bronstein, “Learning shape correspondence with anisotropic convolutional neural networks,” in Proc. of NIPS , 2016, pp. 3189–3197
2016
Earlier work this paper cites.
O. Vinyals, S. Bengio, and M. Kudlur, “Order matters: Sequence to sequence for sets,” in Proc. of ICLR , 2016
2016
Cited alongside, same era.
D. D. Johnson, “Learning graphical state transitions,” in Proc. of ICLR , 2016
2016
Cited alongside, same era.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proc. of CVPR , 2016, pp. 770–778
2016
Cited alongside, same era.
M. M. Bronstein, J. Bruna, Y. LeCun, A. Szlam, and P. Vandergheynst, “Geometric deep learning: going beyond euclidean data,” IEEE Signal Processing Magazine , vol. 34, no. 4, pp. 18–42, 2017
2017
Cited alongside, same era.
W. L. Hamilton, R. Ying, and J. Leskovec, “Representation learning on graphs: Methods and applications,” in Proc. of NIPS , 2017, pp. 1024–1034
2017
Cited alongside, same era.
M. Simonovsky and N. Komodakis, “Graphvae: Towards generation of small graphs using variational autoencoders,” in ICANN . Springer, 2018, pp. 412–422
2018
Later among the works it cites.
T. Ma, J. Chen, and C. Xiao, “Constrained generation of semantically valid graphs via regularizing variational autoencoders,” in Proc. of NeurIPS , 2018, pp. 7110–7121
2018
Later among the works it cites.
N. De Cao and T. Kipf, “MolGAN: An implicit generative model for small molecular graphs,” ICML 2018 workshop on Theoretical Foundations and Applications of Deep Generative Models , 2018
2018
Later among the works it cites.
A. Bojchevski, O. Shchur, D. Zügner, and S. Günnemann, “Netgan: Generating graphs via random walks,” in Proc. of ICML , 2018
2018
Later among the works it cites.
Y. Seo, M. Defferrard, P. Vandergheynst, and X. Bresson, “Structured sequence modeling with graph convolutional recurrent networks,” in International Conference on Neural Information Processing . Springer, 2018, pp. 362–373
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in Proc. of ICLR , 2017
2017
Cited alongside, same era.
R. Levie, F. Monti, X. Bresson, and M. M. Bronstein, “Cayleynets: Graph convolutional neural networks with complex rational spectral filters,” IEEE Transactions on Signal Processing , vol. 67, no. 1, pp. 97–109, 2017
2017
Cited alongside, same era.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in Proc. of ICML , 2017, pp. 1263–1272
2017
Cited alongside, same era.
P. Cui, X. Wang, J. Pei, and W. Zhu, “A survey on network embedding,” IEEE Transactions on Knowledge and Data Engineering , 2017
2017
Cited alongside, same era.
N. Navarin and A. Sperduti, “Approximated neighbours minhash graph node kernel.” in Proc. of ESANN , 2017
2017
Cited alongside, same era.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Proc. of NIPS , 2017, pp. 1024–1034
2017
Cited alongside, same era.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, “Graph attention networks,” in Proc. of ICLR , 2017
2017
Cited alongside, same era.
2018
Later among the works it cites.
Y. Li, R. Yu, C. Shahabi, and Y. Liu, “Diffusion convolutional recurrent neural network: Data-driven traffic forecasting,” in Proc. of ICLR , 2018
2018
Later among the works it cites.
B. Yu, H. Yin, and Z. Zhu, “Spatio-temporal graph convolutional networks: A deep learning framework for traffic forecasting,” in Proc. of IJCAI , 2018, pp. 3634–3640
2018
Later among the works it cites.
S. Yan, Y. Xiong, and D. Lin, “Spatial temporal graph convolutional networks for skeleton-based action recognition,” in Proc. of AAAI , 2018
2018
Later among the works it cites.
J. B. Lee, R. Rossi, and X. Kong, “Graph classification using structural attention,” in Proc. of KDD . ACM, 2018, pp. 1666–1674
2018
Later among the works it cites.
S. Abu-El-Haija, B. Perozzi, R. Al-Rfou, and A. A. Alemi, “Watch your step: Learning node embeddings via graph attention,” in Proc. of NeurIPS , 2018, pp. 9197–9207
2018
Later among the works it cites.
M. Fey, J. E. Lenssen, F. Weichert, and H. Müller, “Splinecnn: Fast geometric deep learning with continuous b-spline kernels,” in Proc. of CVPR , 2018, pp. 869–877
2018
Later among the works it cites.
T. Derr, Y. Ma, and J. Tang, “Signed graph convolutional network,” in Proc. of ICDM , 2018
2018
Later among the works it cites.
F. Scarselli, A. C. Tsoi, and M. Hagenbuchner, “The vapnik–chervonenkis dimension of graph and recursive neural networks,” Neural Networks , vol. 108, pp. 248–259, 2018
2018
Later among the works it cites.
R. Gómez-Bombarelli, J. N. Wei, D. Duvenaud, J. M. Hernández-Lobato, B. Sánchez-Lengeling, D. Sheberla, J. Aguilera-Iparraguirre, T. D. Hirzel, R. P. Adams, and A. Aspuru-Guzik, “Automatic chemical design using a data-driven continuous representation of molecules,” ACS central science , vol. 4, no. 2, pp. 268–276, 2018
2018
Later among the works it cites.
H. Dai, Y. Tian, B. Dai, S. Skiena, and L. Song, “Syntax-directed variational autoencoder for molecule generation,” in Proc. of ICLR , 2018
2018
Later among the works it cites.
M. Schlichtkrull, T. N. Kipf, P. Bloem, R. van den Berg, I. Titov, and M. Welling, “Modeling relational data with graph convolutional networks,” in ESWC . Springer, 2018, pp. 593–607
2018
Later among the works it cites.
O. Shchur, M. Mumme, A. Bojchevski, and S. Günnemann, “Pitfalls of graph neural network evaluation,” in NeurIPS workshop , 2018
2018
Later among the works it cites.
M. Zhang and Y. Chen, “Link prediction based on graph neural networks,” in Proc. of NeurIPS , 2018
2018
Later among the works it cites.
T. Kawamoto, M. Tsubaki, and T. Obuchi, “Mean-field theory of graph neural networks in graph partitioning,” in Proc. of NeurIPS , 2018, pp. 4362–4372
2018
Later among the works it cites.
J. Yang, J. Lu, S. Lee, D. Batra, and D. Parikh, “Graph r-cnn for scene graph generation,” in Proc. of ECCV . Springer, 2018, pp. 690–706
2018
Later among the works it cites.
Y. Li, W. Ouyang, B. Zhou, J. Shi, C. Zhang, and X. Wang, “Factorizable net: an efficient subgraph-based framework for scene graph generation,” in Proc. of ECCV . Springer, 2018, pp. 346–363
2018
Later among the works it cites.
J. Johnson, A. Gupta, and L. Fei-Fei, “Image generation from scene graphs,” in Proc. of CVPR , 2018
2018
Later among the works it cites.
L. Landrieu and M. Simonovsky, “Large-scale point cloud semantic segmentation with superpoint graphs,” in Proc. of CVPR , 2018
2018
Later among the works it cites.
G. Te, W. Hu, A. Zheng, and Z. Guo, “Rgcnn: Regularized graph cnn for point cloud segmentation,” in 2018 ACM Multimedia Conference on Multimedia Conference . ACM, 2018, pp. 746–754
2018
Later among the works it cites.
S. Qi, W. Wang, B. Jia, J. Shen, and S.-C. Zhu, “Learning human-object interactions by graph parsing neural networks,” in Proc. of ECCV . Springer, 2018, pp. 401–417
2018
Later among the works it cites.
V. G. Satorras and J. B. Estrach, “Few-shot learning with graph neural networks,” in Proc. of ICLR , 2018
2018
Later among the works it cites.
M. Guo, E. Chou, D.-A. Huang, S. Song, S. Yeung, and L. Fei-Fei, “Neural graph matching networks for fewshot 3d action recognition,” in Proc. of ECCV . Springer, 2018, pp. 673–689
2018
Later among the works it cites.
X. Chen, L.-J. Li, L. Fei-Fei, and A. Gupta, “Iterative visual reasoning beyond convolutions,” in Proc. of CVPR , 2018
2018
Later among the works it cites.
M. Narasimhan, S. Lazebnik, and A. Schwing, “Out of the box: Reasoning with graph convolution nets for factual visual question answering,” in Proc. of NeurIPS , 2018, pp. 2655–2666
2018
Later among the works it cites.
D. Marcheggiani, J. Bastings, and I. Titov, “Exploiting semantics in neural machine translation with graph convolutional networks,” in Proc. of NAACL , 2018
2018
Later among the works it cites.
L. Song, Y. Zhang, Z. Wang, and D. Gildea, “A graph-to-sequence model for amr-to-text generation,” in Proc. of ACL , 2018
2018
Later among the works it cites.
D. Beck, G. Haffari, and T. Cohn, “Graph-to-sequence learning using gated graph neural networks,” in Proc. of ACL , 2018
2018
Later among the works it cites.
B. Chen, L. Sun, and X. Han, “Sequence-to-action: End-to-end semantic graph generation for semantic parsing,” in Proc. of ACL , 2018, pp. 766–777
2018
Later among the works it cites.
H. Yao, F. Wu, J. Ke, X. Tang, Y. Jia, S. Lu, P. Gong, J. Ye, and Z. Li, “Deep multi-view spatial-temporal network for taxi demand prediction,” in Proc. of AAAI , 2018, pp. 2588–2595
2018
Later among the works it cites.
R. Ying, R. He, K. Chen, P. Eksombatchai, W. L. Hamilton, and J. Leskovec, “Graph convolutional neural networks for web-scale recommender systems,” in Proc. of KDD . ACM, 2018, pp. 974–983
2018
Later among the works it cites.
J. You, B. Liu, R. Ying, V. Pande, and J. Leskovec, “Graph convolutional policy network for goal-directed molecular graph generation,” in Proc. of NeurIPS , 2018
2018
Later among the works it cites.
J. Qiu, J. Tang, H. Ma, Y. Dong, K. Wang, and J. Tang, “Deepinf: Social influence prediction with deep learning,” in Proc. of KDD . ACM, 2018, pp. 2110–2119
2018
Later among the works it cites.
D. Zügner, A. Akbarnejad, and S. Günnemann, “Adversarial attacks on neural networks for graph data,” in Proc. of KDD . ACM, 2018, pp. 2847–2856
2018
Later among the works it cites.
E. Choi, C. Xiao, W. Stewart, and J. Sun, “Mime: Multilevel medical embedding of electronic health records for predictive healthcare,” in Proc. of NeurIPS , 2018, pp. 4548–4558
2018
Later among the works it cites.
T. H. Nguyen and R. Grishman, “Graph convolutional networks with argument-aware pooling for event detection,” in Proc. of AAAI , 2018, pp. 5900–5907
2018
Later among the works it cites.
Z. Li, Q. Chen, and V. Koltun, “Combinatorial optimization with graph convolutional networks and guided tree search,” in Proc. of NeurIPS , 2018, pp. 536–545
2018
Later among the works it cites.
2019
Closest in time.
Z. Liu, C. Chen, L. Li, J. Zhou, X. Li, and L. Song, “Geniepath: Graph neural networks with adaptive receptive paths,” in Proc. of AAAI , 2019
2019
Closest in time.
P. Veličković, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. D. Hjelm, “Deep graph infomax,” in Proc. of ICLR , 2019
2019
Closest in time.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks,” in Proc. of ICLR , 2019
2019
Closest in time.
W.-L. Chiang, X. Liu, S. Si, Y. Li, S. Bengio, and C.-J. Hsieh, “Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks,” in Proc. of KDD . ACM, 2019
2019
Closest in time.
Z. Wu, S. Pan, G. Long, J. Jiang, and C. Zhang, “Graph wavenet for deep spatial-temporal graph modeling,” in Proc. of IJCAI , 2019
2019
Closest in time.
S. Guo, Y. Lin, N. Feng, C. Song, and H. Wan, “Attention based spatial-temporal graph convolutional networks for traffic flow forecasting,” in Proc. of AAAI , 2019
2019
Closest in time.
X. Wang, H. Ji, C. Shi, B. Wang, C. Peng, Y. P., and Y. Ye, “Heterogeneous graph attention network,” in WWW , 2019
2019
Closest in time.
J. Lee, I. Lee, and J. Kang, “Self-attention graph pooling,” in Proc. of ICML , 2019, pp. 3734–3743
2019
Closest in time.
H. Maron, H. Ben-Hamu, N. Shamir, and Y. Lipman, “Invariant and equivariant graph networks,” in ICLR , 2019
2019
Closest in time.
S. Pan, R. Hu, S.-f. Fung, G. Long, J. Jiang, and C. Zhang, “Learning graph embedding with adversarial training methods,” IEEE Transactions on Cybernetics , 2019
2019
Closest in time.
2019
Closest in time.
M. Wang, L. Yu, D. Zheng, Q. Gan, Y. Gai, Z. Ye, M. Li, J. Zhou, Q. Huang, C. Ma, Z. Huang, Q. Guo, H. Zhang, H. Lin, J. Zhao, J. Li, A. J. Smola, and Z. Zhang, “Deep graph library: Towards efficient and scalable deep learning on graphs,” in ICLR Workshop on Representation Learning on Graphs and Manifolds , 2019
2019
Closest in time.
Y. Wang, Y. Sun, Z. Liu, S. E. Sarma, M. M. Bronstein, and J. M. Solomon, “Dynamic graph cnn for learning on point clouds,” ACM Transactions on Graphics (TOG) , 2019
2019
Closest in time.
L. Liu, T. Zhou, G. Long, J. Jiang, L. Yao, and C. Zhang, “Prototype propagation networks (ppn) for weakly-supervised few-shot learning on category graph,” in Proc. of IJCAI , 2019
2019
Closest in time.
Anonymous, “A fair comparison of graph neural networks for graph classification,” in Submitted to ICLR , 2020, under review. [Online]. Available: https://openreview.net/forum?id=HygDF6NFPB
2020
Closest in time.
M. Niepert, M. Ahmed, and K. Kutzkov, “Learning convolutional neural networks for graphs,” in Proc. of ICML , 2016, pp. 2014–2023
2023
Closest in time.