Fetching the paper…
Reading the bibliography…
The era of "data deluge" has sparked renewed interest in graph-based learning methods and their widespread applications ranging from sociology and biology to transportation and communications.
D. E. Rumelhart, G. E. Hinton, and R. J. Williams, “Learning representations by back-propagating errors,” Nature , vol. 323, no. 6088, p. 533, 1986
1986
Earlier work this paper cites.
R. A. Ulichney, “Dithering with blue noise,” Proc. IEEE , vol. 76, no. 1, pp. 56–79, 1988
1988
Earlier work this paper cites.
S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications . Cambridge University Press, 1994, vol. 8
1994
Earlier work this paper cites.
B. Bollobás and B. Béla, Random Graphs . Cambridge university press, 2001, no. 73
2001
Earlier work this paper cites.
A. J. Smola and R. I. Kondor, “Kernels and regularization on graphs,” in Learning Theory and Kernel Machines . Springer, 2003, pp. 144–158
2003
Earlier work this paper cites.
X. Zhu, Z. Ghahramani, and J. D. Lafferty, “Semi-supervised learning using gaussian fields and harmonic functions,” in Proc. Int. Conf. Mach. Learn. , Washington, USA, Jun. 2003
2003
Earlier work this paper cites.
M. Belkin, P. Niyogi, and V. Sindhwani, “Manifold regularization: A geometric framework for learning from labeled and unlabeled examples,” J. Mach. Learn. Res. , vol. 7, pp. 2399–2434, 2006
2006
Earlier work this paper cites.
U. Alon, “Network motifs: Theory and experimental approaches,” Nature Reviews Genetics , vol. 8, no. 6, pp. 450–461, 2007
2007
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.
W. Dong, C. Moses, and K. Li, “Efficient k-nearest neighbor graph construction for generic similarity measures,” in Proc. of Intl. Conf. on World Wide Web , 2011, pp. 577–586
2011
Earlier work this paper cites.
J. Weston, F. Ratle, H. Mobahi, and R. Collobert, “Deep learning via semi-supervised embedding,” in Neural Networks: Tricks of the Trade . Springer, 2012, pp. 639–655
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 Sig. Process. Mag. , vol. 30, no. 3, pp. 83–98, May 2013
2013
Earlier work this paper cites.
J. K. Harris, An Introduction to Exponential Random Graph Modeling . Sage Publications, 2013, vol. 173
2013
Earlier work this paper cites.
M. Kivelä, A. Arenas, M. Barthelemy, J. P. Gleeson, Y. Moreno, and M. A. Porter, “Multilayer networks,” J. of Complex Netw. , vol. 2, no. 3, pp. 203–271, 2014
2014
Earlier work this paper cites.
I. J. Goodfellow, J. Shlens, and C. Szegedy, “Explaining and harnessing adversarial examples,” in Proc. Int. Conf. on Learn. Represantions , 2014
2014
Earlier work this paper cites.
C. C. Aggarwal, “Outlier analysis,” in Data Mining . Springer, 2015, pp. 237–263
2015
Cited alongside, same era.
D. P. Kingma and J. L. Ba, “Adam: A method for stochastic optimization,” in Proc. Int. Conf. on Learn. Represantions , San Diego, CA, USA, May 2015
2015
Cited alongside, same era.
Z. Yang, W. W. Cohen, and R. Salakhutdinov, “Revisiting semi-supervised learning with graph embeddings,” in Proc. Int. Conf. Mach. Learn. , New York, USA, Jun. 2016
2016
Cited alongside, same era.
I. Goodfellow, Y. Bengio, A. Courville, and Y. Bengio, Deep Learning . MIT press Cambridge, 2016, vol. 1
2016
Cited alongside, same era.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in Proc. Advances Neural Inf. Process. Syst. , Barcelona, Spain, Dec. 2016, pp. 3844–3852
2016
M. Schlichtkrull, T. N. Kipf, P. Bloem, R. Van Den Berg, I. Titov, and M. Welling, “Modeling relational data with graph convolutional networks,” in European Semantic Web Conference . Springer, 2018, pp. 593–607
2018
Later among the works it cites.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, “Graph attention networks,” in Proc. Int. Conf. on Learn. Represantions , Vancouver, BC, Canada, 2018
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. Intl. Conf. on Knowledge Disc. and Data Mining , London, United Kingdom, 2018, pp. 2847–2856
2018
Later among the works it cites.
H. Dai, H. Li, T. Tian, X. Huang, L. Wang, J. Zhu, and L. Song, “Adversarial attack on graph structured data,” in Proc. Int. Conf. Mach. Learn. , Stockholm, Sweden, Jul. 2018
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proc. IEEE Conf on Comp. Vision and Pat. Rec. , 2016, pp. 770–778
2016
Cited alongside, same era.
J. V. Candy, Bayesian Signal Processing: Classical, Modern, and Particle Filtering Methods . John Wiley & Sons, 2016, vol. 54
2016
Cited alongside, same era.
M. Abadi, P. Barham, J. Chen, Z. Chen, A. Davis, J. Dean, M. Devin, S. Ghemawat, G. Irving, M. Isard et al. , “Tensorflow: a system for large-scale machine learning.” in Proc. USENIX Symp. Oper. Systems Design Implementation , vol. 16, Savannah, GA, USA, Nov. 2016, pp. 265–283
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 Sig. 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,” in Proc. Int. Conf. on Learn. Represantions , Toulon, France, Apr. 2017
2017
Cited alongside, same era.
E. Isufi, A. Loukas, A. Simonetto, and G. Leus, “Filtering random graph processes over random time-varying graphs,” IEEE Trans. Sig. Process. , vol. 65, no. 16, pp. 4406–4421, 2017
2017
Cited alongside, same era.
D. Dheeru and E. Karra Taniskidou, “UCI machine learning repository,” 2017. [Online]. Available: http://archive.ics.uci.edu/ml
2017
Cited alongside, same era.
G. B. Giannakis, Y. Shen, and G. V. Karanikolas, “Topology identification and learning over graphs: Accounting for nonlinearities and dynamics,” Proc. IEEE , vol. 106, no. 5, pp. 787–807, May 2018
2018
Later among the works it cites.
M. Newman, Networks . Oxford university press, 2018
2018
Later among the works it cites.
J. Ye and L. Akoglu, “Robust semi-supervised learning on multiple networks with noise,” in Pacific-Asia Conf. on Knowl. Disc. and Data Mining . Springer, 2018, pp. 196–208
2018
Later among the works it cites.
D. Berberidis, A. N. Nikolakopoulos, and G. B. Giannakis, “Adaptive diffusions for scalable learning over graphs,” IEEE Trans. Sig. Process. , vol. 67, no. 5, pp. 1307–1321, 2019
2019
Later among the works it cites.
F. Gama, A. G. Marques, G. Leus, and A. Ribeiro, “Convolutional neural networks architectures for signals supported on graphs,” IEEE Trans. Sig. Process. , vol. 67, no. 4, pp. 1034–1049, Feb. 2019
2019
Later among the works it cites.
V. N. Ioannidis, A. G. Marques, and G. B. Giannakis, “A recursive multi-layer graph neural network architecture for processing network data,” in Proc. IEEE Int. Conf. Acoust., Speech, Sig. Process. , London, England, May 2019
2019
Later among the works it cites.
K. Xu, H. Chen, S. Liu, P.-Y. Chen, T.-W. Weng, M. Hong, and X. Lin, “Topology attack and defense for graph neural networks: An optimization perspective,” in Intl. Joint Conf. on Artif. Int. , Macao, China, Aug. 2019
2019
Later among the works it cites.
H. Wu, C. Wang, Y. Tyshetskiy, A. Docherty, K. Lu, and L. Zhu, “Adversarial examples on graph data: Deep insights into attack and defense,” in Intl. Joint Conf. on Artif. Int. , Macao, China, Aug. 2019
2019
Later among the works it cites.
L. Ruiz, F. Gama, and A. Ribeiro, “Gated graph convolutional recurrent neural networks,” in Proc. European Sig. Process. Conf. , 2019
2019
Later among the works it cites.
L. Zhang, G. Wang, and G. B. Giannakis, “Real-time power system state estimation and forecasting via deep unrolled neural networks,” IEEE Trans. Sig. Process. , vol. 67, no. 15, pp. 4069–4077, 2019
2019
Later among the works it cites.
V. N. Ioanndis, A. G. Marques, and G. B. Giannakis, “Graph neural networks for predicting protein functions,” in Proc. IEEE Int. Workshop Comput. Advances Multi-Sensor Adaptive Process. , Guadeloupe, West Indies, Dec. 2019
2019
Later among the works it cites.