Fetching the paper…
Reading the bibliography…
Graph convolutional networks (GCNs) are a family of neural network models that perform inference on graph data by interleaving vertex-wise operations and message-passing exchanges across nodes.
M. E. Newman, D. J. Watts, and S. H. Strogatz, “Random graph models of social networks,” Proceedings of the National Academy of Sciences , vol. 99, no. suppl 1, pp. 2566–2572, 2002
2002
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, 2008
2008
Earlier work this paper cites.
A. Sandryhaila and J. M. Moura, “Big data analysis with signal processing on graphs: Representation and processing of massive data sets with irregular structure,” IEEE Signal Process. Mag. , vol. 31, no. 5, pp. 80–90, 2014
2014
Earlier work this paper cites.
J. Bruna, W. Zaremba, A. Szlam, and Y. Lecun, “Spectral networks and locally connected networks on graphs,” in Proc. International Conference on Learning Representations (ICLR) , 2014
2014
Earlier work this paper cites.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in Proc. 3rd International Conference for Learning Representations (ICLR) , 2014
2014
Earlier work this paper cites.
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” Nature , vol. 521, no. 7553, pp. 436–444, 2015
2015
Earlier work this paper cites.
J. J. McAuley, C. Targett, Q. Shi, and A. van den Hengel, “Image-based recommendations on styles and substitutes.” in SIGIR . ACM, 2015, pp. 43–52
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
Y. Aytar, C. Vondrick, and A. Torralba, “Soundnet: Learning sound representations from unlabeled video,” in Advances in Neural Information Processing Systems , 2016, pp. 892–900
2016
Earlier work this paper cites.
P. Di Lorenzo, S. Barbarossa, P. Banelli, and S. Sardellitti, “Adaptive least mean squares estimation of graph signals,” IEEE Trans. on Signal and Inf. Process. over Netw. , vol. 2, no. 4, pp. 555–568, 2016
2016
Earlier work this paper cites.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in Advances in Neural Information Processing Systems , 2016, pp. 3844–3852
2016
Earlier work this paper cites.
2017
Earlier work this paper cites.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in Proc. 34th International Conference on Machine Learning (ICML) . JMLR. org, 2017, pp. 1263–1272
2017
Earlier work this paper cites.
2017
Cited alongside, same era.
2017
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 Process. Mag. , vol. 34, no. 4, pp. 18–42, 2017
2017
Cited alongside, same era.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” Proc. International Conference on Learning Representations (ICLR) , 2017
2017
Cited alongside, same era.
2018
Later among the works it cites.
L. Yao, C. Mao, and Y. Luo, “Graph convolutional networks for text classification,” in Thirty-Third AAAI Conference on Artificial Intelligence , vol. 33, 2019, pp. 7370–7377
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Romero, M. Ma, and G. B. Giannakis, “Kernel-based reconstruction of graph signals,” IEEE Trans. Signal Process. , vol. 65, no. 3, pp. 764–778, 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
E. Buchnik and E. Cohen, “Bootstrapped graph diffusions: Exposing the power of nonlinearity,” Proceedings of the ACM on Measurement and Analysis of Computing Systems , vol. 2, 03 2017
2017
Cited alongside, same era.
S. Webb, “Deep learning for biology,” Nature , vol. 554, no. 7693, 2018
2018
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, 2018
2018
Cited alongside, same era.
Q. Li, Z. Han, and X.-M. Wu, “Deeper insights into graph convolutional networks for semi-supervised learning,” in Thirty-Second AAAI Conference on Artificial Intelligence , 2018
2018
Cited alongside, same era.
A. Ortega, P. Frossard, J. Kovačević, J. M. Moura, and P. Vandergheynst, “Graph signal processing: Overview, challenges, and applications,” Proceedings of the IEEE , vol. 106, no. 5, pp. 808–828, 2018
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2019
Later among the works it cites.
J. Klicpera, S. Weißenberger, and S. Günnemann, “Diffusion improves graph learning,” in Advances in Neural Information Processing Systems , 2019, pp. 13 333–13 345
2019
Later among the works it cites.
J. Klicpera, A. Bojchevski, and S. Günnemann, “Predict then propagate: Graph neural networks meet personalized pagerank,” in Proc. 2019 International Conference on Learning Representations (ICLR) , 2019
2019
Later among the works it cites.
C. Morris, M. Ritzert, M. Fey, W. L. Hamilton, J. E. Lenssen, G. Rattan, and M. Grohe, “Weisfeiler and leman go neural: Higher-order graph neural networks,” in Thirty-Third AAAI Conference on Artificial Intelligence , vol. 33, 2019, pp. 4602–4609
2019
Later among the works it cites.
Z. Liu, C. Chen, L. Li, J. Zhou, X. Li, L. Song, and Y. Qi, “Geniepath: Graph neural networks with adaptive receptive paths,” in Thirty-Third AAAI Conference on Artificial Intelligence , vol. 33, 2019, pp. 4424–4431
2019
Later among the works it cites.
2019
Later among the works it cites.
M. Fey and J. E. Lenssen, “Fast graph representation learning with PyTorch Geometric,” in ICLR Workshop on Representation Learning on Graphs and Manifolds , 2019
2019
Later among the works it cites.
2020
Closest in time.