Fetching the paper…
Reading the bibliography…
Graph neural networks (GNNs) are emerging machine learning models on graphs.
D. Angluin, “Local and global properties in networks of processors,” in Proceedings of the twelfth annual ACM symposium on Theory of computing , 1980, pp. 82–93
1980
Earlier work this paper cites.
T. Gärtner, P. Flach, and S. Wrobel, “On graph kernels: Hardness results and efficient alternatives,” in Learning theory and kernel machines . Springer, 2003, pp. 129–143
2003
Earlier work this paper cites.
S. P. Borgatti, “Centrality and network flow,” Social networks , vol. 27, no. 1, pp. 55–71, 2005
2005
Earlier work this paper cites.
M. Gori, G. Monfardini, and F. Scarselli, “A new model for learning in graph domains,” in Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005. , vol. 2. IEEE, 2005, pp. 729–734
2005
Earlier work this paper cites.
S. S. Vempala, The random projection method . American Mathematical Soc., 2005, vol. 65
2005
Earlier work this paper cites.
K. M. Borgwardt and H.-P. Kriegel, “Shortest-path kernels on graphs,” in Fifth IEEE international conference on data mining (ICDM’05) . IEEE, 2005, pp. 8–pp
2005
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.
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, pp. 93–93, 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.
N. Shervashidze, P. Schweitzer, E. J. v. Leeuwen, K. Mehlhorn, and K. M. Borgwardt, “Weisfeiler-lehman graph kernels,” Journal of Machine Learning Research , vol. 12, no. Sep, pp. 2539–2561, 2011
2011
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 processing magazine , vol. 30, no. 3, pp. 83–98, 2013
2013
Earlier work this paper cites.
J. Bruna, W. Zaremba, A. Szlam, and Y. Lecun, “Spectral networks and locally connected networks on graphs,” in International Conference on Learning Representations , 2014
2014
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 701–710
2014
Earlier work this paper cites.
J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei, “Line: Large-scale information network embedding,” in Proceedings of the 24th international conference on world wide web , 2015, pp. 1067–1077
2015
Earlier work this paper cites.
Y. Li, D. Tarlow, M. Brockschmidt, and R. Zemel, “Gated graph sequence neural networks,” in International Conference on Learning Representations , 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.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining , 2016, pp. 855–864
2016
Earlier work this paper cites.
D. Wang, P. Cui, and W. Zhu, “Structural deep network embedding,” in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining , 2016, pp. 1225–1234
2016
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Advances in neural information processing systems , 2017, pp. 1024–1034
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 International Conference on Machine Learning , 2017, pp. 1263–1272
2017
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in Proceedings of the 6th International Conference on Learning Representations , 2017
2017
Earlier work this paper cites.
F. Monti, D. Boscaini, J. Masci, E. Rodola, J. Svoboda, and M. M. Bronstein, “Geometric deep learning on graphs and manifolds using mixture model cnns,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2017, pp. 5115–5124
2017
Cited alongside, same era.
T. Kipf, E. Fetaya, K.-C. Wang, M. Welling, and R. Zemel, “Neural relational inference for interacting systems,” in International Conference on Machine Learning , 2018, pp. 2688–2697
2018
Cited alongside, same era.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, “Graph attention networks,” in Proceedings of the 7th International Conference on Learning Representations , 2018
2018
Cited alongside, same era.
K. Xu, C. Li, Y. Tian, T. Sonobe, K.-i. Kawarabayashi, and S. Jegelka, “Representation learning on graphs with jumping knowledge networks,” in International Conference on Machine Learning , 2018, pp. 5453–5462
2018
Cited alongside, same era.
G. Li, M. Muller, A. Thabet, and B. Ghanem, “Deepgcns: Can gcns go as deep as cnns?” in Proceedings of the IEEE/CVF International Conference on Computer Vision , 2019, pp. 9267–9276
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 International Conference on Learning Representations , 2019
2019
Later among the works it cites.
W.-L. Chiang, X. Liu, S. Si, Y. Li, S. Bengio, and C.-J. Hsieh, “Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks,” in Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2019, pp. 257–266
2019
Later among the works it cites.
W. Hu, M. Fey, M. Zitnik, Y. Dong, H. Ren, B. Liu, M. Catasta, and J. Leskovec, “Open graph benchmark: Datasets for machine learning on graphs,” Neural Information Processing Systems (NeurIPS) , 2020
2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
M. Newman, Networks . Oxford university press, 2018
2018
Cited alongside, same era.
Z. Zhang, P. Cui, X. Wang, J. Pei, X. Yao, and W. Zhu, “Arbitrary-order proximity preserved network embedding,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2018, pp. 2778–2786
2018
Cited alongside, same era.
J. Chen, J. Zhu, and L. Song, “Stochastic training of graph convolutional networks with variance reduction,” in International Conference on Machine Learning , 2018, pp. 942–950
2018
Cited alongside, same era.
J. Chen, T. Ma, and C. Xiao, “Fastgcn: Fast learning with graph convolutional networks via importance sampling,” in International Conference on Learning Representations , 2018
2018
Cited alongside, same era.
W. Huang, T. Zhang, Y. Rong, and J. Huang, “Adaptive sampling towards fast graph representation learning,” in Advances in neural information processing systems , 2018
2018
Cited alongside, same era.
O. Shchur, M. Mumme, A. Bojchevski, and S. Günnemann, “Pitfalls of graph neural network evaluation,” Relational Representation Learning Workshop, NeurIPS 2018 , 2018
2018
Cited alongside, same era.
Z. Zhang, P. Cui, and W. Zhu, “Deep learning on graphs: A survey,” IEEE Transactions on Knowledge and Data Engineering , 2020
2020
Closest in time.
2020
Closest in time.
A. Loukas, “What graph neural networks cannot learn: depth vs width,” in International Conference on Learning Representations , 2020
2020
Closest in time.
G. Dasoulas, L. Dos Santos, K. Scaman, and A. Virmaux, “Coloring graph neural networks for node disambiguation,” in Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence , 7 2020, pp. 2126–2132
2020
Closest in time.
G. Corso, L. Cavalleri, D. Beaini, P. Liò, and P. Veličković, “Principal neighbourhood aggregation for graph nets,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Closest in time.
M. Fey, J. E. Lenssen, C. Morris, J. Masci, and N. M. Kriege, “Deep graph matching consensus,” in International Conference on Learning Representations , 2020
2020
Closest in time.
K. Oono and T. Suzuki, “Graph neural networks exponentially lose expressive power for node classification,” in International Conference on Learning Representations , 2020
2020
Closest in time.
K. Sham and S. Greg, “Random projections,” CMSC 35900 (Spring 2009) Large Scale Learning, 2020, [Online; accessed 4-September-2020]. [Online]. Available: https://ttic.uchicago.edu/~gregory/courses/LargeScaleLearning/lectures/jl.pdf
2020
Closest in time.
X. He, K. Deng, X. Wang, Y. Li, Y. Zhang, and M. Wang, “Lightgcn: Simplifying and powering graph convolution network for recommendation,” in Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval , 2020, pp. 639–648
2020
Closest in time.
D. M. Gysi, Í. Do Valle, M. Zitnik, A. Ameli, X. Gan, O. Varol, S. D. Ghiassian, J. Patten, R. A. Davey, J. Loscalzo et al. , “Network medicine framework for identifying drug-repurposing opportunities for covid-19,” Proceedings of the National Academy of Sciences , vol. 118, no. 19, 2021
2021
Closest in time.
H. Cui, et al., “On positional and structural node features for graph neural networks on non-attributed graphs,” The Sixth International Workshop on Deep Learning on Graphs (DLG-KDD’21) , 2021
2021
Closest in time.
D. Beani, S. Passaro, V. Létourneau, W. Hamilton, G. Corso, and P. Liò, “Directional graph networks,” in International Conference on Machine Learning . PMLR, 2021, pp. 748–758
2021
Closest in time.
Z. Zhang, P. Cui, J. Pei, X. Wang, and W. Zhu, “Eigen-gnn: A graph structure preserving plug-in for gnns,” IEEE Transactions on Knowledge and Data Engineering , 2021
2021
Closest in time.
R. Sato, M. Yamada, and H. Kashima, “Random features strengthen graph neural networks,” in Proceedings of the 2021 SIAM International Conference on Data Mining (SDM) . SIAM, 2021, pp. 333–341
2021
Closest in time.
R. Abboud, I. I. Ceylan, M. Grohe, and T. Lukasiewicz, “The surprising power of graph neural networks with random node initialization,” in Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence , 8 2021, pp. 2112–2118
2021
Closest in time.
D. J. Watts, “Networks, dynamics, and the small-world phenomenon,” American Journal of sociology , vol. 105, no. 2, pp. 493–527, 1999
2021
Closest in time.