Fetching the paper…
Reading the bibliography…
In recent years, Graph Convolutional Networks (GCNs) have achieved great success in learning from graph-structured data.
G. Karypis and V. Kumar, “Multilevel k-way partitioning scheme for irregular graphs,” J. Parallel Distributed Comput. , vol. 48, no. 1, pp. 96–129, 1998
1998
Earlier work this paper cites.
G. Karypis and V. Kumar, “A fast and high quality multilevel scheme for partitioning irregular graphs,” SIAM Journal on scientific Computing , vol. 20, no. 1, pp. 359–392, 1998
1998
Earlier work this paper cites.
M. Driels and Y. Shin, “Determining the number of iterations for monte carlo simulations of weapon effectiveness,” 2004
2004
Earlier work this paper cites.
J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su, “Arnetminer: extraction and mining of academic social networks,” in KDD . ACM, 2008, pp. 990–998
2008
Earlier work this paper cites.
T. P. Tanon, D. Vrandecic, S. Schaffert, T. Steiner, and L. Pintscher, “From freebase to wikidata: The great migration,” in WWW . ACM, 2016, pp. 1419–1428
2016
Earlier work this paper cites.
D. Romero, M. Ma, and G. B. Giannakis, “Kernel-based reconstruction of graph signals,” IEEE Trans. Signal Process. , vol. 65, no. 3, pp. 764–778, 2017
2017
Earlier work this paper cites.
I. Chung, T. N. Sainath, B. Ramabhadran, M. Picheny, J. A. Gunnels, V. Austel, U. V. Chaudhari, and B. Kingsbury, “Parallel deep neural network training for big data on blue gene/q,” IEEE Trans. Parallel Distributed Syst. , vol. 28, no. 6, pp. 1703–1714, 2017
2017
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in ICLR (Poster) . OpenReview.net, 2017
2017
Earlier work this paper cites.
W. L. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in NIPS , 2017, pp. 1024–1034
2017
Earlier work this paper cites.
J. Chen, T. Ma, and C. Xiao, “Fastgcn: Fast learning with graph convolutional networks via importance sampling,” in ICLR (Poster) . OpenReview.net, 2018
2018
Earlier work this paper cites.
W. Huang, T. Zhang, Y. Rong, and J. Huang, “Adaptive sampling towards fast graph representation learning,” in NeurIPS , 2018, pp. 4563–4572
2018
Earlier work this paper cites.
V. G. Satorras and J. B. Estrach, “Few-shot learning with graph neural networks,” in ICLR (Poster) . OpenReview.net, 2018
2018
Earlier work this paper cites.
R. Ying, R. He, K. Chen, P. Eksombatchai, W. L. Hamilton, and J. Leskovec, “Graph convolutional neural networks for web-scale recommender systems,” in KDD . ACM, 2018, pp. 974–983
2018
Cited alongside, same era.
J. Chen, J. Zhu, and L. Song, “Stochastic training of graph convolutional networks with variance reduction,” in ICML , ser. Proceedings of Machine Learning Research, vol. 80. PMLR, 2018, pp. 941–949
2018
Cited alongside, same era.
W. Chiang, X. Liu, S. Si, Y. Li, S. Bengio, and C. Hsieh, “Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks,” in KDD . ACM, 2019, pp. 257–266
2019
Cited alongside, same era.
R. Zhu, K. Zhao, H. Yang, W. Lin, C. Zhou, B. Ai, Y. Li, and J. Zhou, “Aligraph: A comprehensive graph neural network platform,” Proc. VLDB Endow. , vol. 12, no. 12, pp. 2094–2105, 2019
2019
Cited alongside, same era.
H. Zeng, H. Zhou, A. Srivastava, R. Kannan, and V. K. Prasanna, “Graphsaint: Graph sampling based inductive learning method,” in ICLR . OpenReview.net, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
A. A. Ahmed, B. Pradhan, S. Chakraborty, A. M. Alamri, and C. Lee, “An optimized deep neural network approach for vehicular traffic noise trend modeling,” IEEE Access , vol. 9, pp. 107 375–107 386, 2021
2021
Closest in time.
T. Ma, H. Wang, L. Zhang, Y. Tian, and N. Al-Nabhan, “Graph classification based on structural features of significant nodes and spatial convolutional neural networks,” Neurocomputing , vol. 423, pp. 639–650, 2021
2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
2019
Cited alongside, same era.
T. Zhao, N. Cui, Y. Chen, and M. Li, “Efficient strategy mining for football social network,” Complex. , vol. 2020, pp. 8 823 189:1–8 823 189:11, 2020
2020
Cited alongside, same era.
2020
Cited alongside, same era.
D. Zhang, X. Huang, Z. Liu, J. Zhou, Z. Hu, X. Song, Z. Ge, L. Wang, Z. Zhang, and Y. Qi, “AGL: A scalable system for industrial-purpose graph machine learning,” Proc. VLDB Endow. , vol. 13, no. 12, pp. 3125–3137, 2020
2020
Cited alongside, same era.
2020
Cited alongside, same era.
2020
Cited alongside, same era.
2021
Closest in time.
S. Scardapane, I. Spinelli, and P. D. Lorenzo, “Distributed training of graph convolutional networks,” IEEE Trans. Signal Inf. Process. over Networks , vol. 7, pp. 87–100, 2021
2021
Closest in time.
Z. Li, X. Wang, J. Li, and Q. Zhang, “Deep attributed network representation learning of complex coupling and interaction,” Knowl. Based Syst. , vol. 212, p. 106618, 2021
2021
Closest in time.
J. Chen, M. Zhong, J. Li, D. Wang, T. Qian, and H. Tu, “Effective deep attributed network representation learning with topology adapted smoothing,” IEEE Transactions on Cybernetics , 2021
2021
Closest in time.
2021
Closest in time.
Y. Bai, C. Li, Z. Lin, Y. Wu, Y. Miao, Y. Liu, and Y. Xu, “Efficient data loader for fast sampling-based GNN training on large graphs,” IEEE Trans. Parallel Distributed Syst. , vol. 32, no. 10, pp. 2541–2556, 2021
2021
Closest in time.
S. Zhao, F. Li, X. Chen, X. Guan, J. Jiang, D. Huang, Y. Qing, S. Wang, P. Wang, G. Zhang, C. Li, P. Luo, and H. Cui, “vpipe: A virtualized acceleration system for achieving efficient and scalable pipeline parallel DNN training,” IEEE Trans. Parallel Distributed Syst. , vol. 33, no. 3, pp. 489–506, 2022
2022
Closest in time.