Fetching the paper…
Reading the bibliography…
Two architectures that generalize convolutional neural networks (CNNs) for the processing of signals supported on graphs are introduced.
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.
T. Joachims, “Analysis of the rocchio algorithm with tfidf for text categorization,” Carnegie Mellon University, Computer Science Technical Report CMU-CS-96-118, 1996
1996
Earlier work this paper cites.
Y. LeCun, K. Kavukcuoglu, and C. Farabet, “Convolutional networks and applications in vision,” in 2010 IEEE Int. Symp. Circuits and Syst. Paris, France: IEEE, 30 May-2 June 2010
2010
Earlier work this paper cites.
A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, “Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications,” Physical Review E , vol. 84, no. 6, p. 066106, Dec. 2011
2011
Earlier work this paper cites.
J. McAuley and J. Leskovec, “Learning to discover social circles in Ego networks,” in 26th Neural Inform. Process. Syst. Stateline, TX: NIPS Foundation, 3-8 Dec. 2012
2012
Earlier work this paper cites.
A. Sandryhaila and J. M. F. Moura, “Discrete signal processing on graphs,” IEEE Trans. Signal Process. , vol. 61, no. 7, pp. 1644–1656, Apr. 2013
2013
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 Process. Mag. , vol. 30, no. 3, pp. 83–98, May 2013
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
A. Sandyhaila and J. M. F. Moura, “Discrete signal processing on graphs: Frequency analysis,” IEEE Trans. Signal Process. , vol. 62, no. 12, pp. 3042–3054, June 2014
2014
Earlier work this paper cites.
A. Sandryhaila and J. M. F. Moura, “Big data analysis with signal processing on graphs,” IEEE Signal Process. Mag. , vol. 31, no. 5, pp. 80–90, Sep. 2014
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
M. M. Najafabadi, F. Villanustre, T. M. Khoshgoftaar, and N. Seliya, “Deep learning applications and challenges in big data analytics,” J. Big Data , vol. 2, no. 1, pp. 1–21, Dec. 2015
2015
Earlier work this paper cites.
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” Nature , vol. 521, no. 7553, pp. 85–117, 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 Trans. Signal Process. , vol. 63, no. 24, pp. 6510–6523, Dec. 2015
2015
Cited alongside, same era.
R. Varma, S. Chen, and J. Kovačević, “Spectrum-blind signal recovery on graphs,” in 2015 IEEE Int. Workshop Comput. Advances Multi-Sensor Adaptive Process. Cancún, México: IEEE, 13-16 Dec. 2015, pp. 81–84
2015
Cited alongside, same era.
D. P. Kingma and J. L. Ba, “ADAM: A method for stochastic optimization,” in 3rd Int. Conf. Learning Representations . San Diego, CA: Assoc. Comput. Linguistics, 7-9 May 2015
2015
Cited alongside, same era.
S. Segarra, M. Eisen, and A. Ribeiro, “Authorship attribution through function word adjacency networks,” IEEE Trans. Signal Process. , vol. 63, no. 20, pp. 5464–5478, Oct. 2015
2015
Cited alongside, same era.
S. Segarra, A. G. Marques, and A. Ribeiro, “Optimal graph-filter design and applications to distributed linear network operators,” IEEE Trans. Signal Process. , vol. 65, no. 15, pp. 4117–4131, Aug. 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in 5th Int. Conf. Learning Representations . Toulon, France: Assoc. Comput. Linguistics, 24-26 Apr. 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. G. Marques, S. Segarra, G. Leus, and A. Ribeiro, “Sampling of graph signals with successive local aggregations,” IEEE Trans. Signal Process. , vol. 64, no. 7, pp. 1832–1843, Apr. 2016
2016
Cited alongside, same era.
H. Greenspan, B. van Ginneken, and R. M. Summers, “Deep learning in medical imaging: Overview and future promise of an exciting new technique,” IEEE Trans. Med. Imag. , vol. 35, no. 5, pp. 1153–1159, May 2016
2016
Cited alongside, same era.
J. Atwood and D. Towsley, “Diffusion-convolutional neural networks,” in 30th Neural Inform. Process. Syst. Barcelona, Spain: NIPS Foundation, 5-10 Dec. 2016
2016
Cited alongside, same era.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in Neural Inform. Process. Syst. 2016 . Barcelona, Spain: NIPS Foundation, 5-10 Dec. 2016
2016
Cited alongside, same era.
M. Niepert, M. Ahmed, and K. Kutzkov, “Learning convolutional neural networks for graphs,” in 33rd Int. Conf. Mach. Learning , New York, NY, 24-26 June 2016
2016
Cited alongside, same era.
I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning , ser. The Adaptive Computation and Machine Learning Series. Cambridge, MA: The MIT Press, 2016
2016
Cited alongside, same era.
A. Anis, A. Gadde, and A. Ortega, “Efficient sampling set selection for bandlimited graph signals using graph spectral proxies,” IEEE Trans. Signal Process. , vol. 64, no. 14, pp. 3775–3789, July 2016
2016
Cited alongside, same era.
M. Tsitsvero, S. Barbarossa, and P. Di Lorenzo, “Signals on graphs: Uncertainty principle and sampling,” IEEE Trans. Signal Process. , vol. 64, no. 18, pp. 4845–4860, Sep. 2016
2016
Cited alongside, same era.
C.-C. J. Kuo, “The CNN as a guided multilayer RECOS transform,” IEEE Signal Process. Mag. , vol. 34, no. 3, pp. 81–89, May 2017
2017
Later among the works it cites.
G. Huang, Z. Liu, L. van der Maaten, and K. Q. Weinberger, “Densely connected convolutional networks,” in IEEE Comput. Soc. Conf. Comput. Vision and Pattern Recognition 2017 . Honolulu, HI: IEEE Comput. Soc., 21-26 July 2017
2017
Later among the works it cites.
D. I. Shuman, P. Vandergheynst, D. Kressner, and P. Frossard, “Distributed signal processing via chebyshev polynomial approximation,” IEEE Trans. Signal, Inform. Process. Netw. , 6 Apr. 2018, early access
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
F. Gama, G. Leus, A. G. Marques, and A. Ribeiro, “Convolutional neural networks via node-varying graph filters,” in 2018 IEEE Data Sci. Workshop . Lausanne, Switzerland: IEEE, 4-6 June 2018
2018
Closest in time.
T. Wiatoski and H. Bölcskei, “A mathematical theory of deep convolutional neural networks for feature extraction,” IEEE Trans. Inf. Theory , vol. 64, no. 3, pp. 1845–1866, March 2018
2018
Closest in time.
G. Puy, N. Tremblay, R. Gribonval, and P. Vandergheynst, “Random sampling of bandlimited graph signals,” Appl. Comput. Harmonic Anal. , vol. 44, no. 2, pp. 446–475, March 2018
2018
Closest in time.