Fetching the paper…
Reading the bibliography…
Graph neural networks (GNNs) realize great success in graph learning but suffer from performance loss when meeting heterophily, i.e.
G. Jeh and J. Widom, “Simrank: a measure of structural-context similarity,” in Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , 2002, pp. 538–543
2002
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.
G. Namata, B. London, L. Getoor, B. Huang, and U. Edu, “Query-driven active surveying for collective classification,” in 10th International Workshop on Mining and Learning with Graphs , vol. 8, 2012, p. 1
2012
Earlier work this paper cites.
W. Tao and G. Li, “Efficient top-k simrank-based similarity join,” in Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data , 2014, pp. 1603–1604
2014
Earlier work this paper cites.
Jure Leskovec and Andrej Krevl, “Snap datasets: Stanford large network dataset collection,” http://snap.stanford.edu/data , 2014
2014
Earlier work this paper cites.
M. Welling and T. N. Kipf, “Semi-supervised classification with graph convolutional networks,” in J. International Conference on Learning Representations (ICLR 2017) , 2016
2016
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” vol. 30, 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
J. Klicpera, A. Bojchevski, and S. Günnemann, “Predict then propagate: Graph neural networks meet personalized pagerank,” International Conference on Learning Representations , 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,” in Proceedings of the 35th International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, J. Dy and A. Krause, Eds., vol. 80. PMLR, 10–15 Jul 2018, pp. 5453–5462
2018
Earlier work this paper cites.
Y. Wang, X. Lian, and L. Chen, “Efficient simrank tracking in dynamic graphs,” in 2018 IEEE 34th international conference on data engineering (ICDE) . IEEE, 2018, pp. 545–556
2018
Earlier work this paper cites.
A. Bojchevski and S. Günnemann, “Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking,” in International Conference on Learning Representations , 2018. [Online]. Available: https://openreview.net/forum?id=r1ZdKJ-0W
2018
Earlier work this paper cites.
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 international conference on machine learning . PMLR, 2019, pp. 21–29
2019
Earlier work this paper 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
Earlier work this paper cites.
J. Gasteiger, S. Weißenberger, and S. Günnemann, “Diffusion Improves Graph Learning,” in 32nd Advances in Neural Information Processing Systems , 2019
2019
Earlier work this paper cites.
F. Wu, A. Souza, T. Zhang, C. Fifty, T. Yu, and K. Weinberger, “Simplifying graph convolutional networks,” in Proceedings of the 36th International Conference on Machine Learning , K. Chaudhuri and R. Salakhutdinov, Eds., vol. 97, 6 2019, pp. 6861–6871
2019
Earlier work this paper cites.
C. B. Clement, M. Bierbaum, K. P. O’Keeffe, and A. A. Alemi, “On the use of arxiv as a dataset,” 2019
2019
Earlier work this paper cites.
M. Fan, D. Cheng, F. Yang, S. Luo, Y. Luo, W. Qian, and A. Zhou, “Fusing global domain information and local semantic information to classify financial documents,” in Proceedings of the 29th ACM International Conference on Information & Knowledge Management , 2020, pp. 2413–2420
2020
Earlier work this paper cites.
M. Chen, Z. Wei, B. Ding, Y. Li, Y. Yuan, X. Du, and J.-R. Wen, “Scalable graph neural networks via bidirectional propagation,” Advances in neural information processing systems , vol. 33, pp. 14 556–14 566, 2020
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.
H. Pei, B. Wei, K. C.-C. Chang, Y. Lei, and B. Yang, “Geom-gcn: Geometric graph convolutional networks,” International Conference on Learning Representations , 2020
2020
Cited alongside, same era.
X. Li, B. Kao, C. Shan, D. Yin, and M. Ester, “Cast: a correlation-based adaptive spectral clustering algorithm on multi-scale data,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2020, pp. 439–449
2020
Cited alongside, same era.
B. Rozemberczki, C. Allen, and R. Sarkar, “Multi-scale attributed node embedding,” Journal of Complex Networks , vol. 9, no. 2, p. cnab014, 2021
2021
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
T. Yang, Y. Wang, Z. Yue, Y. Yang, Y. Tong, and J. Bai, “Graph pointer neural networks.” Proceedings of the … AAAI Conference on Artificial Intelligence , 2022
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,” International Conference on Machine Learning , 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
H. Wang, Z. Wei, Y. Yuan, X. Du, and J.-R. Wen, “Exact single-source simrank computation on large graphs,” in Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data , 2020, pp. 653–663
2020
Cited alongside, same era.
A. Bojchevski, J. Gasteiger, B. Perozzi, A. Kapoor, M. Blais, B. Rózemberczki, M. Lukasik, and S. Günnemann, “Scaling graph neural networks with approximate pagerank,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2020, pp. 2464–2473
2020
Cited alongside, same era.
M. Chen, Z. Wei, Z. Huang, B. Ding, and Y. Li, “Simple and deep graph convolutional networks,” in International Conference on Machine Learning . PMLR, 2020, pp. 1725–1735
2020
Cited alongside, same era.
H. Wang, M. He, Z. Wei, S. Wang, Y. Yuan, X. Du, and J.-R. Wen, “Approximate graph propagation,” in Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining , 2021, pp. 1686–1696
2021
Cited alongside, same era.
M. Liu, Z. Wang, and S. Ji, “Non-local graph neural networks,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2021
2021
Cited alongside, same era.
D. Jin, Z. Yu, C. Huo, R. Wang, X. Wang, D. He, and J. Han, “Universal graph convolutional networks,” Advances in Neural Information Processing Systems , vol. 34, pp. 10 654–10 664, 2021
2021
Cited alongside, same era.
D. Lim, F. Hohne, X. Li, S. L. Huang, V. Gupta, O. Bhalerao, and S. N. Lim, “Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods,” Advances in Neural Information Processing Systems , vol. 34, pp. 20 887–20 902, 2021
2021
Cited alongside, same era.
S. Suresh, V. Budde, J. Neville, P. Li, and J. Ma, “Breaking the limit of graph neural networks by improving the assortativity of graphs with local mixing patterns,” Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining , 2021
2021
Cited alongside, same era.
2022
Later among the works it cites.
L. Yang, W. Zhou, W. Peng, B. Niu, J. Gu, C. Wang, X. Cao, and D. He, “Graph Neural Networks Beyond Compromise Between Attribute and Topology,” in Proceedings of the ACM Web Conference 2022 . Virtual Event, Lyon France: ACM, Apr. 2022, pp. 1127–1135
2022
Later among the works it cites.
2022
Later among the works it cites.
L. Du, X. Shi, Q. Fu, X. Ma, H. Liu, S. Han, and D. Zhang, “Gbk-gnn: Gated bi-kernel graph neural networks for modeling both homophily and heterophily,” in Proceedings of the ACM Web Conference 2022 , 2022, pp. 1550–1558
2022
Later among the works it cites.
T. Wang, D. Jin, R. Wang, D. He, and Y. Huang, “Powerful graph convolutional networks with adaptive propagation mechanism for homophily and heterophily,” in Proceedings of the AAAI conference on artificial intelligence , vol. 36, no. 4, 2022, pp. 4210–4218
2022
Later among the works it cites.
N. Liao, D. Mo, S. Luo, X. Li, and P. Yin, “Scara: Scalable graph neural networks with feature-oriented optimization,” Proceedings of the VLDB Endowment , vol. 15, no. 11, pp. 3240–3248, 2022
2022
Later among the works it cites.
2023
Closest in time.
M. Zou, Z. Gan, R. Cao, C. Guan, and S. Leng, “Similarity-navigated graph neural networks for node classification,” Information Sciences , vol. 633, pp. 41–69, 2023
2023
Closest in time.
L. Liang, X. Hu, Z. Xu, Z. Song, and I. King, “Predicting global label relationship matrix for graph neural networks under heterophily,” Advances in Neural Information Processing Systems , vol. 36, pp. 10 909–10 921, 2023
2023
Closest in time.
N. Liao, S. Luo, X. Li, and J. Shi, “LD2: Scalable heterophilous graph neural network with decoupled embedding,” in Advances in Neural Information Processing Systems , vol. 36, Dec 2023
2023
Closest in time.
N. Liao, D. Mo, S. Luo, X. Li, and P. Yin, “Scalable decoupling graph neural networks with feature-oriented optimization,” The VLDB Journal , vol. 33, no. 3, pp. 667–683, May 2024. [Online]. Available: https://link.springer.com/article/10.1007/s00778-023-00829-6
2024
Closest in time.
H. Liu and S. Luo, “Bird: Efficient approximation of bidirectional hidden personalized pagerank,” Proceedings of the VLDB Endowment , vol. 17, no. 9, pp. 2255–2268, 2024
2024
Closest in time.
Z. Zhu, K. Wang, H. Liu, J. Li, and S. Luo, “Topology-monitorable contrastive learning on dynamic graphs,” in Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , 2024, pp. 4700–4711
2024
Closest in time.