Fetching the paper…
Reading the bibliography…
Recent years have witnessed great success in handling graph-related tasks with Graph Neural Networks (GNNs).
L. Franceschi, M. Niepert, M. Pontil, and X. He, “Learning discrete structures for graph neural networks,” in International conference on machine learning . PMLR, 2019, pp. 1972–1982
1982
Earlier work this paper cites.
C. L. Giles, K. D. Bollacker, and S. Lawrence, “Citeseer: An automatic citation indexing system,” in Proceedings of the third ACM conference on Digital libraries , 1998, pp. 89–98
1998
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.
2013
Earlier work this paper cites.
T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean, “Distributed representations of words and phrases and their compositionality,” in Advances in neural information processing systems , 2013, pp. 3111–3119
2013
Earlier work this paper cites.
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
V. Sadhanala, Y.-X. Wang, and R. Tibshirani, “Graph sparsification approaches for laplacian smoothing,” in Artificial Intelligence and Statistics . PMLR, 2016, pp. 1250–1259
2016
Earlier work this paper cites.
E. Voudigari, N. Salamanos, T. Papageorgiou, and E. J. Yannakoudakis, “Rank degree: An efficient algorithm for graph sampling,” in 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) . IEEE, 2016, pp. 120–129
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Neural information processing systems , 2017, pp. 1024–1034
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
R. A. Rossi, R. Zhou, and N. K. Ahmed, “Deep inductive graph representation learning,” IEEE Transactions on Knowledge and Data Engineering , vol. 32, no. 3, pp. 438–452, 2018
2018
Earlier work this paper cites.
D. Zügner, A. Akbarnejad, and S. Günnemann, “Adversarial attacks on neural networks for graph data,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2018, pp. 2847–2856
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
F. Feng, X. He, J. Tang, and T.-S. Chua, “Graph adversarial training: Dynamically regularizing based on graph structure,” IEEE Transactions on Knowledge and Data Engineering , 2019
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
F. Wu, A. Souza, T. Zhang, C. Fifty, T. Yu, and K. Weinberger, “Simplifying graph convolutional networks,” in International conference on machine learning . PMLR, 2019, pp. 6861–6871
2019
Earlier work this paper cites.
S. Pan, R. Hu, S.-f. Fung, G. Long, J. Jiang, and C. Zhang, “Learning graph embedding with adversarial training methods,” IEEE transactions on cybernetics , vol. 50, no. 6, pp. 2475–2487, 2019
2019
Earlier work this paper cites.
H. Jin and X. Zhang, “Latent adversarial training of graph convolution networks,” in ICML workshop on learning and reasoning with graph-structured representations , vol. 2, 2019
2019
Earlier work this paper cites.
B. Jiang, Z. Zhang, D. Lin, J. Tang, and B. Luo, “Semi-supervised learning with graph learning-convolutional networks,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , 2019, pp. 11 313–11 320
2019
Earlier work this paper cites.
J. Klicpera, S. Weißenberger, and S. Günnemann, “Diffusion improves graph learning,” Advances in Neural Information Processing Systems , vol. 32, 2019
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
M. Liu, H. Gao, and S. Ji, “Towards deeper graph neural networks,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2020, pp. 338–348
2020
Earlier work this paper cites.
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and S. Y. Philip, “A comprehensive survey on graph neural networks,” IEEE transactions on neural networks and learning systems , 2020
2020
Cited alongside, same era.
J. Zhou, G. Cui, S. Hu, Z. Zhang, C. Yang, Z. Liu, L. Wang, C. Li, and M. Sun, “Graph neural networks: A review of methods and applications,” AI Open , vol. 1, pp. 57–81, 2020
2020
Cited alongside, same era.
C. Zheng, B. Zong, W. Cheng, J. Ni, W. Yu, H. Chen, and W. Wang, “Robust graph representation learning via neural sparsification,” in International Conference on Machine Learning . PMLR, 2020, pp. 11 458–11 468
2020
Cited alongside, same era.
2020
Cited alongside, same era.
S. Freitas, D. Yang, S. Kumar, H. Tong, and D. H. Chau, “Graph vulnerability and robustness: A survey,” IEEE Transactions on Knowledge and Data Engineering , vol. 35, no. 6, pp. 5915–5934, 2022
2022
Later among the works it cites.
H. Li, X. Wang, Z. Zhang, and W. Zhu, “Ood-gnn: Out-of-distribution generalized graph neural network,” IEEE Transactions on Knowledge and Data Engineering , 2022
2022
Later among the works it cites.
L. Wu, H. Lin, Y. Huang, and S. Z. Li, “Knowledge distillation improves graph structure augmentation for graph neural networks,” Advances in Neural Information Processing Systems , vol. 35, pp. 11 815–11 827, 2022
2022
Later among the works it cites.
C. Wei, J. Liang, D. Liu, and F. Wang, “Contrastive graph structure learning via information bottleneck for recommendation,” Advances in Neural Information Processing Systems , vol. 35, pp. 20 407–20 420, 2022
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Z. Zhang, P. Cui, and W. Zhu, “Deep learning on graphs: A survey,” IEEE Transactions on Knowledge and Data Engineering , 2020
2020
Cited alongside, same era.
2020
Cited alongside, same era.
J. Xia, H. Lin, L. Wu, Z. Gao, S. Li, and S. Z. Li, “Towards robust graph neural networks against label noise,” 2020
2020
Cited alongside, same era.
D. Yu, R. Zhang, Z. Jiang, Y. Wu, and Y. Yang, “Graph-revised convolutional network,” in Joint European Conference on Machine Learning and Knowledge Discovery in Databases . Springer, 2020, pp. 378–393
2020
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,” Advances in neural information processing systems , vol. 33, pp. 7793–7804, 2020
2020
Cited alongside, same era.
Y. You, T. Chen, Y. Sui, T. Chen, Z. Wang, and Y. Shen, “Graph contrastive learning with augmentations,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Cited alongside, same era.
2020
Cited alongside, same era.
K. Hassani and A. H. Khasahmadi, “Contrastive multi-view representation learning on graphs,” in International Conference on Machine Learning . PMLR, 2020, pp. 4116–4126
2020
Cited alongside, same era.
Y. Liu, M. Jin, S. Pan, C. Zhou, Y. Zheng, F. Xia, and S. Y. Philip, “Graph self-supervised learning: A survey,” IEEE Transactions on Knowledge and Data Engineering , vol. 35, no. 6, pp. 5879–5900, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
X. Li, R. Zhu, Y. Cheng, C. Shan, S. Luo, D. Li, and W. Qian, “Finding global homophily in graph neural networks when meeting heterophily,” in International Conference on Machine Learning . PMLR, 2022, pp. 13 242–13 256
2022
Later among the works it cites.
Z. Hou, X. Liu, Y. Cen, Y. Dong, H. Yang, C. Wang, and J. Tang, “Graphmae: Self-supervised masked graph autoencoders,” in Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , 2022, pp. 594–604
2022
Later among the works it cites.
J. Xia, L. Wu, J. Chen, B. Hu, and S. Z. Li, “Simgrace: A simple framework for graph contrastive learning without data augmentation,” in Proceedings of the ACM Web Conference 2022 , 2022, pp. 1070–1079
2022
Later among the works it cites.
S. Liu, H. Wang, W. Liu, J. Lasenby, H. Guo, and J. Tang, “Pre-training molecular graph representation with 3d geometry,” in International Conference on Learning Representations , 2022. [Online]. Available: https://openreview.net/forum?id=xQUe1pOKPam
2022
Later among the works it cites.
L. Wu, H. Lin, B. Hu, C. Tan, Z. Gao, Z. Liu, and S. Z. Li, “Beyond homophily and homogeneity assumption: Relation-based frequency adaptive graph neural networks,” IEEE Transactions on Neural Networks and Learning Systems , 2023
2023
Later among the works it cites.
L. Wu, H. Lin, Y. Huang, and S. Z. Li, “Quantifying the knowledge in gnns for reliable distillation into mlps,” in International Conference on Machine Learning . PMLR, 2023, pp. 37 571–37 581
2023
Later among the works it cites.
L. Wu, H. Lin, Y. Huang, T. Fan, and S. Z. Li, “Extracting low-/high-frequency knowledge from graph neural networks and injecting it into mlps: An effective gnn-to-mlp distillation framework,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 37, no. 9, 2023, pp. 10 351–10 360
2023
Later among the works it cites.
X. He, B. Hooi, T. Laurent, A. Perold, Y. LeCun, and X. Bresson, “A generalization of vit/mlp-mixer to graphs,” in International conference on machine learning . PMLR, 2023, pp. 12 724–12 745
2023
Later among the works it cites.
L. Ma, C. Lin, D. Lim, A. Romero-Soriano, P. K. Dokania, M. Coates, P. Torr, and S.-N. Lim, “Graph inductive biases in transformers without message passing,” in International Conference on Machine Learning . PMLR, 2023, pp. 23 321–23 337
2023
Later among the works it cites.
L. Wu, C. Tan, Z. Liu, Z. Gao, H. Lin, and S. Z. Li, “Learning to augment graph structure for both homophily and heterophily graphs,” in Joint European Conference on Machine Learning and Knowledge Discovery in Databases . Springer, 2023, pp. 3–18
2023
Later among the works it cites.
L. Wu, H. Lin, Z. Liu, Z. Liu, Y. Huang, and S. Z. Li, “Homophily-enhanced self-supervision for graph structure learning: Insights and directions,” IEEE Transactions on Neural Networks and Learning Systems , 2023
2023
Later among the works it cites.
M. Gu, G. Yang, S. Zhou, N. Ma, J. Chen, Q. Tan, M. Liu, and J. Bu, “Homophily-enhanced structure learning for graph clustering,” in Proceedings of the 32nd ACM International Conference on Information and Knowledge Management , 2023, pp. 577–586
2023
Later among the works it cites.
S. Zhang, Y. Xiong, Y. Zhang, Y. Sun, X. Chen, Y. Jiao, and Y. Zhu, “Rdgsl: Dynamic graph representation learning with structure learning,” in Proceedings of the 32nd ACM International Conference on Information and Knowledge Management , 2023, pp. 3174–3183
2023
Later among the works it cites.
J. Xia, H. Lin, Y. Xu, C. Tan, L. Wu, S. Li, and S. Z. Li, “Gnn cleaner: Label cleaner for graph structured data,” IEEE Transactions on Knowledge and Data Engineering , 2023
2023
Later among the works it cites.
2024
Closest in time.
2024
Closest in time.
C. Lv, M. Qi, X. Li, Z. Yang, and H. Ma, “Sgformer: Semantic graph transformer for point cloud-based 3d scene graph generation,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 38, no. 5, 2024, pp. 4035–4043
2024
Closest in time.
2024
Closest in time.
Q. Wu, W. Zhao, C. Yang, H. Zhang, F. Nie, H. Jiang, Y. Bian, and J. Yan, “Simplifying and empowering transformers for large-graph representations,” Advances in Neural Information Processing Systems , vol. 36, 2024
2024
Closest in time.