Fetching the paper…
Reading the bibliography…
Recent years have witnessed the emergence and development of graph neural networks (GNNs), which have been shown as a powerful approach for graph representation learning in many tasks, such as node classification and graph classification.
S. Kullback, “Letter to the editor: The kullback-leibler distance,” 1987
1987
Earlier work this paper cites.
R. Klinkenberg and T. Joachims, “Detecting concept drift with support vector machines.” in ICML , 2000, pp. 487–494
2000
Earlier work this paper cites.
J. Atwood and D. Towsley, “Diffusion-convolutional neural networks,” in Advances in neural information processing systems , 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.
J. J. Sutherland, L. A. O’brien, and D. F. Weaver, “Spline-fitting with a genetic algorithm: A method for developing classification structure- activity relationships,” Journal of chemical information and computer sciences , vol. 43, no. 6, pp. 1906–1915, 2003
2003
Earlier work this paper cites.
N. Dalvi, P. Domingos, S. Sanghai, and D. Verma, “Adversarial classification,” in Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining , 2004, pp. 99–108
2004
Earlier work this paper cites.
D. Lowd and C. Meek, “Adversarial learning,” in Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , 2005, pp. 641–647
2005
Earlier work this paper cites.
J. Kazius, R. McGuire, and R. Bursi, “Derivation and validation of toxicophores for mutagenicity prediction,” Journal of medicinal chemistry , vol. 48, no. 1, pp. 312–320, 2005
2005
Earlier work this paper cites.
A. Globerson and S. Roweis, “Nightmare at test time: robust learning by feature deletion,” in Proceedings of the 23rd international conference on Machine learning , 2006, pp. 353–360
2006
Earlier work this paper cites.
B. Nelson, M. Barreno, F. J. Chi, A. D. Joseph, B. I. Rubinstein, U. Saini, C. A. Sutton, J. D. Tygar, and K. Xia, “Exploiting machine learning to subvert your spam filter.” LEET , vol. 8, pp. 1–9, 2008
2008
Earlier work this paper cites.
K. Riesen and H. Bunke, “Iam graph database repository for graph based pattern recognition and machine learning,” in Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR) . Springer, 2008, pp. 287–297
2008
Earlier work this paper cites.
V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, “Fast unfolding of communities in large networks,” Journal of statistical mechanics: theory and experiment , vol. 2008, no. 10, p. P10008, 2008
2008
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.
B. I. Rubinstein, B. Nelson, L. Huang, A. D. Joseph, S.-h. Lau, S. Rao, N. Taft, and J. D. Tygar, “Antidote: understanding and defending against poisoning of anomaly detectors,” in Proceedings of the 9th ACM SIGCOMM conference on Internet measurement , 2009, pp. 1–14
2009
Earlier work this paper cites.
M. Barreno, B. Nelson, A. D. Joseph, and J. D. Tygar, “The security of machine learning,” Machine Learning , vol. 81, no. 2, pp. 121–148, 2010
2010
Earlier work this paper cites.
L. Lovász, Large networks and graph limits . American Mathematical Soc., 2012, vol. 60
2012
Earlier work this paper cites.
2012
Earlier work this paper cites.
E. Mones, L. Vicsek, and T. Vicsek, “Hierarchy measure for complex networks,” PloS one , vol. 7, no. 3, 2012
2012
Earlier work this paper cites.
D. Koutra, J. T. Vogelstein, and C. Faloutsos, “Deltacon: A principled massive-graph similarity function,” in Proceedings of the 2013 SIAM International Conference on Data Mining . SIAM, 2013, pp. 162–170
2013
Earlier work this paper cites.
C. Szegedy, W. Liu, Y. Jia, P. Sermanet, S. Reed, D. Anguelov, D. Erhan, V. Vanhoucke, and A. Rabinovich, “Going deeper with convolutions,” in Proceedings of the IEEE conference on computer vision and pattern recognition , 2015, pp. 1–9
2015
Cited alongside, same era.
R. Girshick, “Fast r-cnn,” in Proceedings of the IEEE international conference on computer vision , 2015, pp. 1440–1448
2015
Cited alongside, same era.
2015
Cited alongside, same era.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proceedings of the IEEE conference on computer vision and pattern recognition , 2016, pp. 770–778
2016
Cited alongside, same era.
2018
Later among the works it cites.
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…
2016
Cited alongside, same era.
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
Cited alongside, same era.
K. Kersting, N. M. Kriege, C. Morris, P. Mutzel, and M. Neumann, “Benchmark data sets for graph kernels,” 2016, http://graphkernels.cs.tu-dortmund.de
2016
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 Proceedings of the 34th International Conference on Machine Learning-Volume 70 . JMLR. org, 2017, pp. 1263–1272
2017
Cited alongside, same era.
M. Fey, J. Eric Lenssen, F. Weichert, and H. Müller, “Splinecnn: Fast geometric deep learning with continuous b-spline kernels,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2018, pp. 869–877
2018
Cited alongside, same era.
H. Gao, Z. Wang, and S. Ji, “Large-scale learnable graph convolutional networks,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2018, pp. 1416–1424
2018
Cited alongside, same era.
2018
Cited alongside, same era.
Z. Ying, J. You, C. Morris, X. Ren, W. Hamilton, and J. Leskovec, “Hierarchical graph representation learning with differentiable pooling,” in Advances in neural information processing systems , 2018, pp. 4800–4810
2018
Cited alongside, same era.
Y. Ma, S. Wang, C. C. Aggarwal, and J. Tang, “Graph convolutional networks with eigenpooling,” in Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2019, pp. 723–731
2019
Later among the works it cites.
J. Lee, I. Lee, and J. Kang, “Self-attention graph pooling,” arXiv preprint arXiv:1904.08082 , 2019
2019
Later among the works it cites.
H. Gao and S. Ji, “Graph u-nets,” arXiv preprint arXiv:1905.05178 , 2019
2019
Later among the works it cites.
G. Ma, N. K. Ahmed, T. L. Willke, D. Sengupta, M. W. Cole, N. B. Turk-Browne, and P. S. Yu, “Deep graph similarity learning for brain data analysis,” in Proceedings of the 28th ACM International Conference on Information and Knowledge Management , 2019, pp. 2743–2751
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
S. Wang, Z. Chen, X. Yu, D. Li, J. Ni, L.-A. Tang, J. Gui, Z. Li, H. Chen, and P. S. Yu, “Heterogeneous graph matching networks for unknown malware detection,” in Proceedings of the 28th International Joint Conference on Artificial Intelligence . AAAI Press, 2019, pp. 3762–3770
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
H. Wu, C. Wang, Y. Tyshetskiy, A. Docherty, K. Lu, and L. Zhu, “Adversarial examples for graph data: Deep insights into attack and defense,” in International Joint Conference on Artificial Intelligence, IJCAI , 2019, pp. 4816–4823
2019
Later among the works it cites.
S. S. Du, K. Hou, R. R. Salakhutdinov, B. Poczos, R. Wang, and K. Xu, “Graph neural tangent kernel: Fusing graph neural networks with graph kernels,” in Advances in Neural Information Processing Systems , 2019, pp. 5724–5734
2019
Later among the works it cites.
H. Chang, Y. Rong, T. Xu, W. Huang, H. Zhang, P. Cui, W. Zhu, and J. Huang, “A restricted black-box adversarial framework towards attacking graph embedding models,” in AAAI Conference on Artificial Intelligence , 2020
2020
Closest in time.
B. Wang and N. Z. Gong, “Attacking graph-based classification via manipulating the graph structure,” in Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security , 2019, pp. 2023–2040
2040
Closest in time.