Graphs, Convolutions, and Neural Networks: From Graph Filters to Graph Neural Networks

H. S. Witsenhausen, “A counterexample in stochastic optimum control,” SIAM J. Control , vol. 6, no. 1, pp. 131–147, 1968

Original

1968

Earlier work this paper cites.

D. E. Rumelhart, G. E. Hinton, and R. J. Williams, “Learning representations by back-propagating errors,” Nature , vol. 323, no. 6088, pp. 533–536, Oct. 1986

1986

Earlier work this paper cites.

E. Isufi, F. Gama, and A. Ribeiro, “EdgeNets: Edge varying graph neural networks,” arXiv:2001.07620v2 [cs.LG] , 12 March 2020. [Online]. Available: http://arxiv.org/abs/2001.07620

Original

2001

Earlier work this paper cites.

M. Püschel and J. M. F. Moura, “Algebraic signal processing theory: Foundation and 1-d time,” IEEE Trans. Signal Process. , vol. 56, no. 8, pp. 3575–3585, Aug. 2008

2008

Earlier work this paper cites.

S. Mallat, “Group invariant scattering,” Commun. Pure, Appl. Math. , vol. 65, no. 10, pp. 1331–1398, Oct. 2012

2012

Earlier work this paper cites.

J. Bruna, W. Zaremba, A. Szlam, and Y. LeCun, “Spectral networks and deep locally connected networks on graphs,” in 2nd Int. Conf. Learning Representations , Banff, AB, 14-16 Apr. 2014, pp. 1–14

2014

Earlier work this paper cites.

D. P. Kingma and J. L. Ba, “ADAM: A method for stochastic optimization,” in 3rd Int. Conf. Learning Representations , San Diego, CA, 7-9 May 2015, pp. 1–15

2015

Earlier work this paper cites.

I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning , ser. The Adaptive Computation and Machine Learning Series. Cambridge, MA: The MIT Press, 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 30th Conf. Neural Inform. Process. Syst. , Barcelona, Spain, 5-10 Dec. 2016, pp. 3844–3858

2016

Earlier work this paper cites.

J. Atwood and D. Towsley, “Diffusion-convolutional neural networks,” in 30th Conf. Neural Inform. Process. Syst. , Barcelona, Spain, 5-10 Dec. 2016

2016

Cited alongside, same era.

F. M. Harper and J. A. Konstan, “The MovieLens datasets: History and context,” ACM Trans. Interactive Intell. Syst. , vol. 5, no. 4, pp. 19:(1–19), Jan. 2016

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 Process. Mag. , vol. 34, no. 4, pp. 18–42, July 2017

2017

Cited alongside, same era.

T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in 5th Int. Conf. Learning Representations , Toulon, France, 24-26 Apr. 2017, pp. 1–14

2017

Cited alongside, same era.

E. Isufi, A. Loukas, A. Simonetto, and G. Leus, “Autoregressive moving average graph filtering,” IEEE Trans. Signal Process. , vol. 65, no. 2, pp. 274–288, Jan. 2017

F. Gama, A. G. Marques, G. Leus, and A. Ribeiro, “Convolutional neural network architectures for signals supported on graphs,” IEEE Trans. Signal Process. , vol. 67, no. 4, pp. 1034–1049, Feb. 2019

2019

Later among the works it cites.

F. Wu, A. Souza, T. Zhang, C. Fifty, T. Yu, and K. Weinberger, “Simplifying graph convolutional networks,” in 36th Int. Conf. Mach. Learning , vol. 97. Long Beach, CA: PMLR, 9-15 June 2019, pp. 6861–6871

2019

Later among the works it cites.

K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in 7th Int. Conf. Learning Representations , New Orleans, LA, 6-9 May 2019, pp. 1–17

2019

Later among the works it cites.

M. Coutino, E. Isufi, and G. Leus, “Advances in distributed graph filtering,” IEEE Trans. Signal Process. , vol. 67, no. 9, pp. 2320–2333, May 2019

2019

Later among the works it cites.