Fetching the paper…
Reading the bibliography…
Graph Neural Networks (GNNs) learn low dimensional representations of nodes by aggregating information from their neighborhood in graphs.
M. E. Newman, “Analysis of weighted networks,” Physical review E , vol. 70, no. 5, 2004
2004
Earlier work this paper cites.
M. E. Newman, “Modularity and community structure in networks,” Proceedings of the national academy of sciences , vol. 103, no. 23, pp. 8577–8582, 2006
2006
Earlier work this paper cites.
V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, “Fast unfolding of communities in large networks,” JSTAT , vol. 2008, no. 10, p. P10008, 2008
2008
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in NeurIPS , 2017, pp. 1024–1034
2017
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” ICLR , 2017
2017
Earlier work this paper cites.
X. Wang, P. Cui, J. Wang, J. Pei, W. Zhu, and S. Yang, “Community preserving network embedding.” in AAAI , vol. 17, 2017, pp. 203–209
2017
Earlier work this paper cites.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, “Graph attention networks,” ICLR , 2018
2018
Earlier work this paper cites.
K. Xu, C. Li, Y. Tian, T. Sonobe, K.-i. Kawarabayashi, and S. Jegelka, “Representation learning on graphs with jumping knowledge networks,” ICML , 2018
2018
Earlier work this paper cites.
Q. Li, Z. Han, and X.-M. Wu, “Deeper insights into graph convolutional networks for semi-supervised learning,” AAAI , 2018
2018
Cited alongside, same era.
M. I. Belghazi, A. Baratin, S. Rajeshwar, S. Ozair, Y. Bengio, A. Courville, and D. Hjelm, “Mutual information neural estimation,” in ICML , 2018, pp. 531–540
2018
Cited alongside, same era.
P. Velickovic, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. D. Hjelm, “Deep graph infomax.” in ICLR (Poster) , 2019
2019
Cited alongside, same era.
G. Li, M. Muller, A. Thabet, and B. Ghanem, “Deepgcns: Can gcns go as deep as cnns?” in ICCV , 2019, pp. 9267–9276
2019
Cited alongside, same era.
Y. Rong, W. Huang, T. Xu, and J. Huang, “Dropedge: Towards deep graph convolutional networks on node classification,” in ICLR , 2019
2019
Cited alongside, same era.
Y. Hou, J. Zhang, J. Cheng, K. Ma, R. T. Ma, H. Chen, and M.-C. Yang, “Measuring and improving the use of graph information in gnns,” in ICLR , 2019
2019
Later among the works it cites.
H. Pei, B. Wei, K. C.-C. Chang, Y. Lei, and B. Yang, “Geom-gcn: Geometric graph convolutional networks,” ICLR , 2020
2020
Later among the works it cites.
D. Chen, Y. Lin, W. Li, P. Li, J. Zhou, and X. Sun, “Measuring and relieving the over-smoothing problem for gnns from the topological view.” in AAAI , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
Y. You, T. Chen, Z. Wang, and Y. Shen, “When does self-supervision help graph convolutional networks?” in ICML , 2020
2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Fey, “Just jump: Dynamic neighborhood aggregation in gnns,” ICLR , 2019
2019
Cited alongside, same era.
R. D. Hjelm, A. Fedorov, S. Lavoie-Marchildon, K. Grewal, P. Bachman, A. Trischler, and Y. Bengio, “Learning deep representations by mutual information estimation and maximization,” ICLR , 2019
2019
Cited alongside, same era.
Later among the works it cites.
P. Wang, Y. Fu, Y. Zhou, K. Liu, X. Li, and K. Hua, “Exploiting mutual information for substructure-aware graph representation learning,” in IJCAI , 2020
2020
Later among the works it cites.