{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:28:20Z","timestamp":1773246500640,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["1947135,2134079,1939725"],"award-info":[{"award-number":["1947135,2134079,1939725"]}]},{"name":"DARPA","award":["HR001121C0165"],"award-info":[{"award-number":["HR001121C0165"]}]},{"name":"NIFA","award":["2020-67021-32799"],"award-info":[{"award-number":["2020-67021-32799"]}]},{"name":"DHS","award":["17STQAC00001-06-00"],"award-info":[{"award-number":["17STQAC00001-06-00"]}]},{"name":"ARO","award":["W911NF2110088"],"award-info":[{"award-number":["W911NF2110088"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599446","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:13:58Z","timestamp":1691172838000},"page":"2862-2873","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Node Classification Beyond Homophily: Towards a General Solution"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6675-1398","authenticated-orcid":false,"given":"Zhe","family":"Xu","sequence":"first","affiliation":[{"name":"University of Illinois Urbana-Champaign, Champaign, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5863-0588","authenticated-orcid":false,"given":"Yuzhong","family":"Chen","sequence":"additional","affiliation":[{"name":"Visa Research, Palo Alto, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2571-5796","authenticated-orcid":false,"given":"Qinghai","family":"Zhou","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Champaign, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0641-9107","authenticated-orcid":false,"given":"Yuhang","family":"Wu","sequence":"additional","affiliation":[{"name":"Visa Research, Palo Alto, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8390-7147","authenticated-orcid":false,"given":"Menghai","family":"Pan","sequence":"additional","affiliation":[{"name":"Visa Research, Palo Alto, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3020-9828","authenticated-orcid":false,"given":"Hao","family":"Yang","sequence":"additional","affiliation":[{"name":"Visa Research, Palo Alto, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4405-3887","authenticated-orcid":false,"given":"Hanghang","family":"Tong","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Champaign, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Muhammet Balcilar Guillaume Renton Pierre H\u00e9roux Benoit Ga\u00fcz\u00e8re S\u00e9bastien Adam and Paul Honeine. 2021. Analyzing the expressive power of graph neural networks in a spectral perspective. In ICLR.  Muhammet Balcilar Guillaume Renton Pierre H\u00e9roux Benoit Ga\u00fcz\u00e8re S\u00e9bastien Adam and Paul Honeine. 2021. Analyzing the expressive power of graph neural networks in a spectral perspective. In ICLR."},{"key":"e_1_3_2_2_2_1","unstructured":"Filippo Maria Bianchi Daniele Grattarola and Cesare Alippi. 2020. Spectral clustering with graph neural networks for graph pooling. In ICML.  Filippo Maria Bianchi Daniele Grattarola and Cesare Alippi. 2020. Spectral clustering with graph neural networks for graph pooling. In ICML."},{"key":"e_1_3_2_2_3_1","unstructured":"Deyu Bo Xiao Wang Chuan Shi and Huawei Shen. 2021. Beyond Low-frequency Information in Graph Convolutional Networks. In AAAI.  Deyu Bo Xiao Wang Chuan Shi and Huawei Shen. 2021. Beyond Low-frequency Information in Graph Convolutional Networks. In AAAI."},{"key":"e_1_3_2_2_4_1","unstructured":"Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking. In ICLR.  Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking. In ICLR."},{"key":"e_1_3_2_2_5_1","unstructured":"Lei Chen Zhengdao Chen and Joan Bruna. 2021. On Graph Neural Networks versus Graph-Augmented MLPs. In ICLR.  Lei Chen Zhengdao Chen and Joan Bruna. 2021. On Graph Neural Networks versus Graph-Augmented MLPs. In ICLR."},{"key":"e_1_3_2_2_6_1","volume-title":"Adaptive Universal Generalized PageRank Graph Neural Network. In International Conference on Learning Representations.","author":"Chien Eli","year":"2021","unstructured":"Eli Chien , Jianhao Peng , Pan Li , and Olgica Milenkovic . 2021 . Adaptive Universal Generalized PageRank Graph Neural Network. In International Conference on Learning Representations. Eli Chien, Jianhao Peng, Pan Li, and Olgica Milenkovic. 2021. Adaptive Universal Generalized PageRank Graph Neural Network. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3575637.3575646"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Lun Du Xiaozhou Shi Qiang Fu Xiaojun Ma Hengyu Liu Shi Han and Dongmei Zhang. 2022. GBK-GNN: Gated Bi-Kernel Graph Neural Networks for Modeling Both Homophily and Heterophily. In TheWebConf.  Lun Du Xiaozhou Shi Qiang Fu Xiaojun Ma Hengyu Liu Shi Han and Dongmei Zhang. 2022. GBK-GNN: Gated Bi-Kernel Graph Neural Networks for Modeling Both Homophily and Heterophily. In TheWebConf.","DOI":"10.1145\/3485447.3512201"},{"key":"e_1_3_2_2_9_1","unstructured":"Luca Franceschi Mathias Niepert Massimiliano Pontil and Xiao He. 2019. Learning discrete structures for graph neural networks. In ICML.  Luca Franceschi Mathias Niepert Massimiliano Pontil and Xiao He. 2019. Learning discrete structures for graph neural networks. In ICML."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.3389\/fdata.2022.1062637"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3572726"},{"key":"e_1_3_2_2_12_1","unstructured":"Justin Gilmer Samuel S Schoenholz Patrick F Riley Oriol Vinyals and George E Dahl. 2017. Neural message passing for quantum chemistry. In ICML.  Justin Gilmer Samuel S Schoenholz Patrick F Riley Oriol Vinyals and George E Dahl. 2017. Neural message passing for quantum chemistry. In ICML."},{"key":"e_1_3_2_2_13_1","volume-title":"Inductive representation learning on large graphs. NeurIPS","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton , Zhitao Ying , and Jure Leskovec . 2017. Inductive representation learning on large graphs. NeurIPS ( 2017 ). Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. NeurIPS (2017)."},{"key":"e_1_3_2_2_14_1","volume-title":"Bernnet: Learning arbitrary graph spectral filters via bernstein approximation. NeurIPS","author":"He Mingguo","year":"2021","unstructured":"Mingguo He , Zhewei Wei , Hongteng Xu , 2021 . Bernnet: Learning arbitrary graph spectral filters via bernstein approximation. NeurIPS (2021). Mingguo He, Zhewei Wei, Hongteng Xu, et al. 2021. Bernnet: Learning arbitrary graph spectral filters via bernstein approximation. NeurIPS (2021)."},{"key":"e_1_3_2_2_15_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling . 2017 . Semi-Supervised Classification with Graph Convolutional Networks. In ICLR. Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_2_16_1","unstructured":"Johannes Klicpera Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR.  Johannes Klicpera Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR."},{"key":"e_1_3_2_2_17_1","volume-title":"Learning graph-level representation for drug discovery. arXiv preprint arXiv:1709.03741","author":"Li Junying","year":"2017","unstructured":"Junying Li , Deng Cai , and Xiaofei He. 2017. Learning graph-level representation for drug discovery. arXiv preprint arXiv:1709.03741 ( 2017 ). Junying Li, Deng Cai, and Xiaofei He. 2017. Learning graph-level representation for drug discovery. arXiv preprint arXiv:1709.03741 (2017)."},{"key":"e_1_3_2_2_18_1","volume-title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily. arXiv preprint arXiv:2205","author":"Li Xiang","year":"2022","unstructured":"Xiang Li , Renyu Zhu , Yao Cheng , Caihua Shan , Siqiang Luo , Dongsheng Li , and Weining Qian . 2022 . Finding Global Homophily in Graph Neural Networks When Meeting Heterophily. arXiv preprint arXiv:2205 .07308 (2022). Xiang Li, Renyu Zhu, Yao Cheng, Caihua Shan, Siqiang Luo, Dongsheng Li, and Weining Qian. 2022. Finding Global Homophily in Graph Neural Networks When Meeting Heterophily. arXiv preprint arXiv:2205.07308 (2022)."},{"key":"e_1_3_2_2_19_1","volume-title":"Vaishnavi Gupta, Omkar Bhalerao, and Ser Nam Lim.","author":"Lim Derek","year":"2021","unstructured":"Derek Lim , Felix Hohne , Xiuyu Li , Sijia Linda Huang , Vaishnavi Gupta, Omkar Bhalerao, and Ser Nam Lim. 2021 . Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods. NeurIPS ( 2021). Derek Lim, Felix Hohne, Xiuyu Li, Sijia Linda Huang, Vaishnavi Gupta, Omkar Bhalerao, and Ser Nam Lim. 2021. Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods. NeurIPS (2021)."},{"key":"e_1_3_2_2_20_1","volume-title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification? arXiv preprint arXiv:2109.05641","author":"Luan Sitao","year":"2021","unstructured":"Sitao Luan , Chenqing Hua , Qincheng Lu , Jiaqi Zhu , Mingde Zhao , Shuyuan Zhang , Xiao-Wen Chang , and Doina Precup . 2021. Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification? arXiv preprint arXiv:2109.05641 ( 2021 ). Sitao Luan, Chenqing Hua, Qincheng Lu, Jiaqi Zhu, Mingde Zhao, Shuyuan Zhang, Xiao-Wen Chang, and Doina Precup. 2021. Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification? arXiv preprint arXiv:2109.05641 (2021)."},{"key":"e_1_3_2_2_21_1","unstructured":"Dongsheng Luo Wei Cheng Wenchao Yu Bo Zong Jingchao Ni Haifeng Chen and Xiang Zhang. 2021. Learning to drop: Robust graph neural network via topological denoising. In WSDM.  Dongsheng Luo Wei Cheng Wenchao Yu Bo Zong Jingchao Ni Haifeng Chen and Xiang Zhang. 2021. Learning to drop: Robust graph neural network via topological denoising. In WSDM."},{"key":"e_1_3_2_2_22_1","volume-title":"Is homophily a necessity for graph neural networks? arXiv preprint arXiv:2106.06134","author":"Ma Yao","year":"2021","unstructured":"Yao Ma , Xiaorui Liu , Neil Shah , and Jiliang Tang . 2021. Is homophily a necessity for graph neural networks? arXiv preprint arXiv:2106.06134 ( 2021 ). Yao Ma, Xiaorui Liu, Neil Shah, and Jiliang Tang. 2021. Is homophily a necessity for graph neural networks? arXiv preprint arXiv:2106.06134 (2021)."},{"key":"e_1_3_2_2_23_1","volume-title":"Networks","author":"Newman Mark","unstructured":"Mark Newman . 2018. Networks . Oxford university press . Mark Newman. 2018. Networks. Oxford university press."},{"key":"e_1_3_2_2_24_1","volume-title":"Yu Lei, and Bo Yang.","author":"Pei Hongbin","year":"2019","unstructured":"Hongbin Pei , Bingzhe Wei , Kevin Chen-Chuan Chang , Yu Lei, and Bo Yang. 2019 . Geom-GCN: Geometric Graph Convolutional Networks. In ICLR. Hongbin Pei, Bingzhe Wei, Kevin Chen-Chuan Chang, Yu Lei, and Bo Yang. 2019. Geom-GCN: Geometric Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnab014"},{"key":"e_1_3_2_2_26_1","volume-title":"Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868","author":"Shchur Oleksandr","year":"2018","unstructured":"Oleksandr Shchur , Maximilian Mumme , Aleksandar Bojchevski , and Stephan G\u00fcnnemann . 2018. Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868 ( 2018 ). Oleksandr Shchur, Maximilian Mumme, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868 (2018)."},{"key":"e_1_3_2_2_27_1","volume-title":"The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains","author":"Shuman David I","year":"2013","unstructured":"David I Shuman , Sunil K Narang , Pascal Frossard , Antonio Ortega , and Pierre Vandergheynst . 2013. The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains . IEEE signal processing magazine, Vol. 30 , 3 ( 2013 ), 83--98. David I Shuman, Sunil K Narang, Pascal Frossard, Antonio Ortega, and Pierre Vandergheynst. 2013. The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE signal processing magazine, Vol. 30, 3 (2013), 83--98."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Susheel Suresh Vinith Budde Jennifer Neville Pan Li and Jianzhu Ma. 2021. Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns. In KDD.  Susheel Suresh Vinith Budde Jennifer Neville Pan Li and Jianzhu Ma. 2021. Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns. In KDD.","DOI":"10.1145\/3447548.3467373"},{"key":"e_1_3_2_2_29_1","first-page":"3221","article-title":"Accelerating t-SNE using tree-based algorithms","volume":"15","author":"Der Maaten Laurens Van","year":"2014","unstructured":"Laurens Van Der Maaten . 2014 . Accelerating t-SNE using tree-based algorithms . The Journal of Machine Learning Research , Vol. 15 , 1 (2014), 3221 -- 3245 . Laurens Van Der Maaten. 2014. Accelerating t-SNE using tree-based algorithms. The Journal of Machine Learning Research, Vol. 15, 1 (2014), 3221--3245.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_2_2_30_1","unstructured":"Petar Velivc kovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR.  Petar Velivc kovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Ruijia Wang Shuai Mou Xiao Wang Wanpeng Xiao Qi Ju Chuan Shi and Xing Xie. 2021. Graph Structure Estimation Neural Networks. In TheWebConf.  Ruijia Wang Shuai Mou Xiao Wang Wanpeng Xiao Qi Ju Chuan Shi and Xing Xie. 2021. Graph Structure Estimation Neural Networks. In TheWebConf.","DOI":"10.1145\/3442381.3449952"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Tao Wang Di Jin Rui Wang Dongxiao He and Yuxiao Huang. 2022a. Powerful Graph Convolutional Networks with Adaptive Propagation Mechanism for Homophily and Heterophily. In AAAI.  Tao Wang Di Jin Rui Wang Dongxiao He and Yuxiao Huang. 2022a. Powerful Graph Convolutional Networks with Adaptive Propagation Mechanism for Homophily and Heterophily. In AAAI.","DOI":"10.1609\/aaai.v36i4.20340"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Tao Wang Rui Wang Di Jin Dongxiao He and Yuxiao Huang. 2022b. Powerful Graph Convolutioal Networks with Adaptive Propagation Mechanism for Homophily and Heterophily. In AAAI.  Tao Wang Rui Wang Di Jin Dongxiao He and Yuxiao Huang. 2022b. Powerful Graph Convolutioal Networks with Adaptive Propagation Mechanism for Homophily and Heterophily. In AAAI.","DOI":"10.1609\/aaai.v36i4.20340"},{"key":"e_1_3_2_2_34_1","unstructured":"Felix Wu Amauri Souza Tianyi Zhang Christopher Fifty Tao Yu and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In ICML.  Felix Wu Amauri Souza Tianyi Zhang Christopher Fifty Tao Yu and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In ICML."},{"key":"e_1_3_2_2_35_1","volume-title":"Graph Information Bottleneck. NeurIPS","author":"Wu Tailin","year":"2020","unstructured":"Tailin Wu , Hongyu Ren , Pan Li , and Jure Leskovec . 2020. Graph Information Bottleneck. NeurIPS ( 2020 ). Tailin Wu, Hongyu Ren, Pan Li, and Jure Leskovec. 2020. Graph Information Bottleneck. NeurIPS (2020)."},{"key":"e_1_3_2_2_36_1","unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2018. How Powerful are Graph Neural Networks?. In ICLR.  Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2018. How Powerful are Graph Neural Networks?. In ICLR."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512180"},{"key":"e_1_3_2_2_38_1","volume-title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. arXiv preprint arXiv:2102.06462","author":"Yan Yujun","year":"2021","unstructured":"Yujun Yan , Milad Hashemi , Kevin Swersky , Yaoqing Yang , and Danai Koutra . 2021. Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. arXiv preprint arXiv:2102.06462 ( 2021 ). Yujun Yan, Milad Hashemi, Kevin Swersky, Yaoqing Yang, and Danai Koutra. 2021. Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. arXiv preprint arXiv:2102.06462 (2021)."},{"key":"e_1_3_2_2_39_1","unstructured":"Liang Yang Mengzhe Li Liyang Liu Chuan Wang Xiaochun Cao Yuanfang Guo etal 2021. Diverse Message Passing for Attribute with Heterophily. NeurIPS (2021).  Liang Yang Mengzhe Li Liyang Liu Chuan Wang Xiaochun Cao Yuanfang Guo et al. 2021. Diverse Message Passing for Attribute with Heterophily. NeurIPS (2021)."},{"key":"e_1_3_2_2_40_1","unstructured":"Zhilin Yang William Cohen and Ruslan Salakhudinov. 2016. Revisiting semi-supervised learning with graph embeddings. In ICML.  Zhilin Yang William Cohen and Ruslan Salakhudinov. 2016. Revisiting semi-supervised learning with graph embeddings. In ICML."},{"key":"e_1_3_2_2_41_1","unstructured":"Junchi Yu Tingyang Xu Yu Rong Yatao Bian Junzhou Huang and Ran He. 2020. Graph Information Bottleneck for Subgraph Recognition. In ICLR.  Junchi Yu Tingyang Xu Yu Rong Yatao Bian Junzhou Huang and Ran He. 2020. Graph Information Bottleneck for Subgraph Recognition. In ICLR."},{"key":"e_1_3_2_2_42_1","volume-title":"Link prediction based on graph neural networks. NeurIPS","author":"Zhang Muhan","year":"2018","unstructured":"Muhan Zhang and Yixin Chen . 2018. Link prediction based on graph neural networks. NeurIPS ( 2018 ). Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. NeurIPS (2018)."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Yingxue Zhang Soumyasundar Pal Mark Coates and Deniz Ustebay. 2019. Bayesian graph convolutional neural networks for semi-supervised classification. In AAAI.  Yingxue Zhang Soumyasundar Pal Mark Coates and Deniz Ustebay. 2019. Bayesian graph convolutional neural networks for semi-supervised classification. In AAAI.","DOI":"10.1609\/aaai.v33i01.33015829"},{"key":"e_1_3_2_2_44_1","volume-title":"Learning Optimal Propagation for Graph Neural Networks. arXiv preprint arXiv:2205.02998","author":"Zhao Beidi","year":"2022","unstructured":"Beidi Zhao , Boxin Du , Zhe Xu , Liangyue Li , and Hanghang Tong . 2022a. Learning Optimal Propagation for Graph Neural Networks. arXiv preprint arXiv:2205.02998 ( 2022 ). Beidi Zhao, Boxin Du, Zhe Xu, Liangyue Li, and Hanghang Tong. 2022a. Learning Optimal Propagation for Graph Neural Networks. arXiv preprint arXiv:2205.02998 (2022)."},{"key":"e_1_3_2_2_45_1","volume-title":"Graph Data Augmentation for Graph Machine Learning: A Survey. arXiv preprint arXiv:2202.08871","author":"Zhao Tong","year":"2022","unstructured":"Tong Zhao , Gang Liu , Stephan G\u00fcnnemann , and Meng Jiang . 2022b. Graph Data Augmentation for Graph Machine Learning: A Survey. arXiv preprint arXiv:2202.08871 ( 2022 ). Tong Zhao, Gang Liu, Stephan G\u00fcnnemann, and Meng Jiang. 2022b. Graph Data Augmentation for Graph Machine Learning: A Survey. arXiv preprint arXiv:2202.08871 (2022)."},{"key":"e_1_3_2_2_46_1","volume-title":"Graph Neural Networks for Graphs with Heterophily: A Survey. arXiv preprint arXiv:2202.07082","author":"Zheng Xin","year":"2022","unstructured":"Xin Zheng , Yixin Liu , Shirui Pan , Miao Zhang , Di Jin , and Philip S Yu. 2022. Graph Neural Networks for Graphs with Heterophily: A Survey. arXiv preprint arXiv:2202.07082 ( 2022 ). Xin Zheng, Yixin Liu, Shirui Pan, Miao Zhang, Di Jin, and Philip S Yu. 2022. Graph Neural Networks for Graphs with Heterophily: A Survey. arXiv preprint arXiv:2202.07082 (2022)."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Jiong Zhu Ryan A Rossi Anup Rao Tung Mai Nedim Lipka Nesreen K Ahmed and Danai Koutra. 2021a. Graph Neural Networks with Heterophily. In AAAI.  Jiong Zhu Ryan A Rossi Anup Rao Tung Mai Nedim Lipka Nesreen K Ahmed and Danai Koutra. 2021a. Graph Neural Networks with Heterophily. In AAAI.","DOI":"10.1609\/aaai.v35i12.17332"},{"key":"e_1_3_2_2_48_1","volume-title":"Beyond homophily in graph neural networks: Current limitations and effective designs. NeurIPS","author":"Zhu Jiong","year":"2020","unstructured":"Jiong Zhu , Yujun Yan , Lingxiao Zhao , Mark Heimann , Leman Akoglu , and Danai Koutra . 2020. Beyond homophily in graph neural networks: Current limitations and effective designs. NeurIPS ( 2020 ). Jiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann, Leman Akoglu, and Danai Koutra. 2020. Beyond homophily in graph neural networks: Current limitations and effective designs. NeurIPS (2020)."},{"key":"e_1_3_2_2_49_1","volume-title":"Deep graph structure learning for robust representations: A survey. arXiv preprint arXiv:2103.03036","author":"Zhu Yanqiao","year":"2021","unstructured":"Yanqiao Zhu , Weizhi Xu , Jinghao Zhang , Qiang Liu , Shu Wu , and Liang Wang . 2021b. Deep graph structure learning for robust representations: A survey. arXiv preprint arXiv:2103.03036 ( 2021 ). Yanqiao Zhu, Weizhi Xu, Jinghao Zhang, Qiang Liu, Shu Wu, and Liang Wang. 2021b. Deep graph structure learning for robust representations: A survey. arXiv preprint arXiv:2103.03036 (2021)."}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Long Beach CA USA","acronym":"KDD '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599446","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599446","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:36Z","timestamp":1750178256000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":49,"alternative-id":["10.1145\/3580305.3599446","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599446","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}