Fetching the paper…
Reading the bibliography…
Graph neural networks (GNNs) have achieved great success in various graph problems.
L. Page, S. Brin, R. Motwani, and T. Winograd, “The pagerank citation ranking: Bringing order to the web.” Stanford InfoLab, Tech. Rep., 1999
1999
Earlier work this paper cites.
D. Liben-Nowell and J. Kleinberg, “The link-prediction problem for social networks,” Journal of the American society for information science and technology , vol. 58, no. 7, pp. 1019–1031, 2007
2007
Earlier work this paper cites.
S. Pandit, D. H. Chau, S. Wang, and C. Faloutsos, “Netprobe: a fast and scalable system for fraud detection in online auction networks,” in WWW , 2007, pp. 201–210
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, pp. 93–93, 2008
2008
Earlier work this paper cites.
J. Weston, S. Chopra, and A. Bordes, “Memory networks,” CoRR , vol. abs/1410.3916, 2015
2015
Earlier work this paper cites.
S. Sukhbaatar, J. Weston, R. Fergus et al. , “End-to-end memory networks,” NeurIPS , vol. 28, 2015
2015
Earlier work this paper cites.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” NeurIPS , vol. 29, 2016
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in ICLR , 2017
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 . PMLR, 2017, pp. 1263–1272
2017
Earlier work this paper cites.
M. Zhang and Y. Chen, “Link prediction based on graph neural networks,” NeurIPS , vol. 31, 2018
2018
Cited alongside, same era.
M. Zhang, Z. Cui, M. Neumann, and Y. Chen, “An end-to-end deep learning architecture for graph classification,” in AAAI , 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 ICML . PMLR, 2018, pp. 5453–5462
2018
Cited alongside, same era.
2018
Cited alongside, same era.
J. Klicpera, S. Weißenberger, and S. Günnemann, “Diffusion improves graph learning,” NeurIPS , vol. 32, 2019
2019
Cited alongside, same era.
H. Pei, B. Wei, K. C.-C. Chang, Y. Lei, and B. Yang, “Geom-gcn: Geometric graph convolutional networks,” in ICLR , 2020
2020
Later among the works it cites.
E. Dai, S. Zhou, Z. Guo, and S. Wang, “Label-wise message passing graph neural network on heterophilic graphs,” 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
E. Chien, J. Peng, P. Li, and O. Milenkovic, “Adaptive universal generalized pagerank graph neural network,” in ICLR , 2021
2021
Later among the works it cites.
J. Zhu, R. A. Rossi, A. Rao, T. Mai, N. Lipka, N. K. Ahmed, and D. Koutra, “Graph neural networks with heterophily,” in AAAI , vol. 35, no. 12, 2021, pp. 11 168–11 176
2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Abu-El-Haija, B. Perozzi, A. Kapoor, N. Alipourfard, K. Lerman, H. Harutyunyan, G. Ver Steeg, and A. Galstyan, “Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing,” in ICML . PMLR, 2019, pp. 21–29
2019
Cited alongside, same era.
M. Fey and J. E. Lenssen, “Fast graph representation learning with PyTorch Geometric,” in ICLR Workshop on Representation Learning on Graphs and Manifolds , 2019
2019
Cited alongside, same era.
J. Zhu, Y. Yan, L. Zhao, M. Heimann, L. Akoglu, and D. Koutra, “Beyond homophily in graph neural networks: Current limitations and effective designs,” NeurIPS , vol. 33, 2020
2020
Cited alongside, same era.
X. Tang, H. Yao, Y. Sun, C. Aggarwal, P. Mitra, and S. Wang, “Joint modeling of local and global temporal dynamics for multivariate time series forecasting with missing values,” in AAAI , vol. 34, no. 04, 2020, pp. 5956–5963
2020
Cited alongside, same era.
Later among the works it cites.
2022
Closest in time.
Y. Ma, X. Liu, N. Shah, and J. Tang, “Is homophily a necessity for graph neural networks?” in ICLR , 2022
2022
Closest in time.
J. Chen, W. Liu, and J. Pu, “Memory-based message passing: Decoupling the message for propagation from discrimination,” in ICASSP . IEEE, 2022, pp. 4033–4037
2022
Closest in time.
T. Xiao, Z. Chen, Z. Guo, Z. Zhuang, and S. Wang, “Decoupled self-supervised learning for non-homophilous graphs,” in NeurIPS , 2022
2022
Closest in time.