{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T08:40:40Z","timestamp":1768466440070,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Innovative Human Resource Development for Local Intellectualization support program","award":["RS-2022-00156287"],"award-info":[{"award-number":["RS-2022-00156287"]}]},{"name":"National Research Foundation of Korea (NRF)","award":["2016R1A5A1012966 2016R1A5A1012966"],"award-info":[{"award-number":["2016R1A5A1012966 2016R1A5A1012966"]}]},{"name":"Artificial Intelligence Innovation Hub","award":["RS-2022-00156287"],"award-info":[{"award-number":["RS-2022-00156287"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,17]]},"DOI":"10.1145\/3511808.3557324","type":"proceedings-article","created":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T01:22:22Z","timestamp":1665883342000},"page":"283-292","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Finding Heterophilic Neighbors via Confidence-based Subgraph Matching for Semi-supervised Node Classification"],"prefix":"10.1145","author":[{"given":"Yoonhyuk","family":"Choi","sequence":"first","affiliation":[{"name":"Seoul National University, Seoul, South Korea"}]},{"given":"Jiho","family":"Choi","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, Republic of Korea"}]},{"given":"Taewook","family":"Ko","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, Republic of Korea"}]},{"given":"Hyungho","family":"Byun","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, Republic of Korea"}]},{"given":"Chong-Kwon","family":"Kim","sequence":"additional","affiliation":[{"name":"Korea Institute of Energy Technology, Naju, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Beyond low-frequency information in graph convolutional networks. arXiv preprint arXiv:2101.00797","author":"Bo Deyu","year":"2021","unstructured":"Deyu Bo , Xiao Wang , Chuan Shi , and Huawei Shen . 2021. Beyond low-frequency information in graph convolutional networks. arXiv preprint arXiv:2101.00797 ( 2021 ). Deyu Bo, Xiao Wang, Chuan Shi, and Huawei Shen. 2021. Beyond low-frequency information in graph convolutional networks. arXiv preprint arXiv:2101.00797 (2021)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159731"},{"key":"e_1_3_2_1_3_1","volume-title":"International Conference on Machine Learning. PMLR, 1725--1735","author":"Chen Ming","year":"2020","unstructured":"Ming Chen , Zhewei Wei , Zengfeng Huang , Bolin Ding , and Yaliang Li . 2020 . Simple and deep graph convolutional networks . In International Conference on Machine Learning. PMLR, 1725--1735 . Ming Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding, and Yaliang Li. 2020. Simple and deep graph convolutional networks. In International Conference on Machine Learning. PMLR, 1725--1735."},{"key":"e_1_3_2_1_4_1","volume-title":"International conference on machine learning. PMLR, 685--693","author":"Cuturi Marco","year":"2014","unstructured":"Marco Cuturi and Arnaud Doucet . 2014 . Fast computation of Wasserstein barycenters . In International conference on machine learning. PMLR, 685--693 . Marco Cuturi and Arnaud Doucet. 2014. Fast computation of Wasserstein barycenters. In International conference on machine learning. PMLR, 685--693."},{"key":"e_1_3_2_1_5_1","volume-title":"Convolutional neural networks on graphs with fast localized spectral filtering. Advances in neural information processing systems","author":"Defferrard Micha\u00ebl","year":"2016","unstructured":"Micha\u00ebl Defferrard , Xavier Bresson , and Pierre Vandergheynst . 2016. Convolutional neural networks on graphs with fast localized spectral filtering. Advances in neural information processing systems , Vol. 29 ( 2016 ). Micha\u00ebl Defferrard, Xavier Bresson, and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. Advances in neural information processing systems, Vol. 29 (2016)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i1.16079"},{"key":"e_1_3_2_1_7_1","volume-title":"Graph neural networks with adaptive frequency response filter. arXiv preprint arXiv:2104.12840","author":"Dong Yushun","year":"2021","unstructured":"Yushun Dong , Kaize Ding , Brian Jalaian , Shuiwang Ji , and Jundong Li. 2021. Graph neural networks with adaptive frequency response filter. arXiv preprint arXiv:2104.12840 ( 2021 ). Yushun Dong, Kaize Ding, Brian Jalaian, Shuiwang Ji, and Jundong Li. 2021. Graph neural networks with adaptive frequency response filter. arXiv preprint arXiv:2104.12840 (2021)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371789"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Wenqi Fan Yao Ma Qing Li Yuan He Eric Zhao Jiliang Tang and Dawei Yin. 2019. Graph neural networks for social recommendation. In The world wide web conference. 417--426.  Wenqi Fan Yao Ma Qing Li Yuan He Eric Zhao Jiliang Tang and Dawei Yin. 2019. Graph neural networks for social recommendation. In The world wide web conference. 417--426.","DOI":"10.1145\/3308558.3313488"},{"key":"e_1_3_2_1_10_1","volume-title":"Protein interface prediction using graph convolutional networks. Advances in neural information processing systems","author":"Fout Alex","year":"2017","unstructured":"Alex Fout , Jonathon Byrd , Basir Shariat , and Asa Ben-Hur . 2017. Protein interface prediction using graph convolutional networks. Advances in neural information processing systems , Vol. 30 ( 2017 ). Alex Fout, Jonathon Byrd, Basir Shariat, and Asa Ben-Hur. 2017. Protein interface prediction using graph convolutional networks. Advances in neural information processing systems, Vol. 30 (2017)."},{"key":"e_1_3_2_1_11_1","volume-title":"International conference on machine learning. PMLR, 1263--1272","author":"Gilmer Justin","year":"2017","unstructured":"Justin Gilmer , Samuel S Schoenholz , Patrick F Riley , Oriol Vinyals , and George E Dahl . 2017 . Neural message passing for quantum chemistry . In International conference on machine learning. PMLR, 1263--1272 . Justin Gilmer, Samuel S Schoenholz, Patrick F Riley, Oriol Vinyals, and George E Dahl. 2017. Neural message passing for quantum chemistry. In International conference on machine learning. PMLR, 1263--1272."},{"key":"e_1_3_2_1_12_1","volume-title":"Inductive representation learning on large graphs. Advances in neural information processing systems","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton , Zhitao Ying , and Jure Leskovec . 2017. Inductive representation learning on large graphs. Advances in neural information processing systems , Vol. 30 ( 2017 ). Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. Advances in neural information processing systems, Vol. 30 (2017)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.04.005"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441735"},{"key":"e_1_3_2_1_15_1","volume-title":"How to find your friendly neighborhood: Graph attention design with self-supervision. arXiv preprint arXiv:2204.04879","author":"Kim Dongkwan","year":"2022","unstructured":"Dongkwan Kim and Alice Oh. 2022. How to find your friendly neighborhood: Graph attention design with self-supervision. arXiv preprint arXiv:2204.04879 ( 2022 ). Dongkwan Kim and Alice Oh. 2022. How to find your friendly neighborhood: Graph attention design with self-supervision. arXiv preprint arXiv:2204.04879 (2022)."},{"key":"e_1_3_2_1_16_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 ( 2016 ). Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_1_17_1","volume-title":"Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997","author":"Klicpera Johannes","year":"2018","unstructured":"Johannes Klicpera , Aleksandar Bojchevski , and Stephan G\u00fcnnemann . 2018. Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997 ( 2018 ). Johannes Klicpera, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997 (2018)."},{"key":"e_1_3_2_1_18_1","volume-title":"Wasserstein embedding for graph learning. arXiv preprint arXiv:2006.09430","author":"Kolouri Soheil","year":"2020","unstructured":"Soheil Kolouri , Navid Naderializadeh , Gustavo K Rohde , and Heiko Hoffmann . 2020. Wasserstein embedding for graph learning. arXiv preprint arXiv:2006.09430 ( 2020 ). Soheil Kolouri, Navid Naderializadeh, Gustavo K Rohde, and Heiko Hoffmann. 2020. Wasserstein embedding for graph learning. arXiv preprint arXiv:2006.09430 (2020)."},{"key":"e_1_3_2_1_19_1","volume-title":"Deep learning. nature","author":"LeCun Yann","year":"2015","unstructured":"Yann LeCun , Yoshua Bengio , and Geoffrey Hinton . 2015. Deep learning. nature , Vol. 521 , 7553 ( 2015 ), 436--444. Yann LeCun, Yoshua Bengio, and Geoffrey Hinton. 2015. Deep learning. nature, Vol. 521, 7553 (2015), 436--444."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512172"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3134200"},{"key":"e_1_3_2_1_23_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_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441734"},{"key":"e_1_3_2_1_25_1","volume-title":"Graph entropy guided node embedding dimension selection for graph neural networks. arXiv preprint arXiv:2105.03178","author":"Luo Gongxu","year":"2021","unstructured":"Gongxu Luo , Jianxin Li , Jianlin Su , Hao Peng , Carl Yang , Lichao Sun , Philip S Yu , and Lifang He. 2021b. Graph entropy guided node embedding dimension selection for graph neural networks. arXiv preprint arXiv:2105.03178 ( 2021 ). Gongxu Luo, Jianxin Li, Jianlin Su, Hao Peng, Carl Yang, Lichao Sun, Philip S Yu, and Lifang He. 2021b. Graph entropy guided node embedding dimension selection for graph neural networks. arXiv preprint arXiv:2105.03178 (2021)."},{"key":"e_1_3_2_1_26_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_1_27_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"e_1_3_2_1_28_1","volume-title":"Birds of a feather: Homophily in social networks. Annual review of sociology","author":"McPherson Miller","year":"2001","unstructured":"Miller McPherson , Lynn Smith-Lovin , and James M Cook . 2001. Birds of a feather: Homophily in social networks. Annual review of sociology , Vol. 27 , 1 ( 2001 ), 415--444. Miller McPherson, Lynn Smith-Lovin, and James M Cook. 2001. Birds of a feather: Homophily in social networks. Annual review of sociology, Vol. 27, 1 (2001), 415--444."},{"key":"e_1_3_2_1_29_1","volume-title":"A trainable optimal transport embedding for feature aggregation and its relationship to attention. arXiv preprint arXiv:2006.12065","author":"Mialon Gr\u00e9goire","year":"2020","unstructured":"Gr\u00e9goire Mialon , Dexiong Chen , Alexandre d' Aspremont , and Julien Mairal . 2020. A trainable optimal transport embedding for feature aggregation and its relationship to attention. arXiv preprint arXiv:2006.12065 ( 2020 ). Gr\u00e9goire Mialon, Dexiong Chen, Alexandre d'Aspremont, and Julien Mairal. 2020. A trainable optimal transport embedding for feature aggregation and its relationship to attention. arXiv preprint arXiv:2006.12065 (2020)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242600"},{"key":"e_1_3_2_1_31_1","volume-title":"Yu Lei, and Bo Yang.","author":"Pei Hongbin","year":"2020","unstructured":"Hongbin Pei , Bingzhe Wei , Kevin Chen-Chuan Chang , Yu Lei, and Bo Yang. 2020 . Geom-gcn : Geometric graph convolutional networks. arXiv preprint arXiv:2002.05287 (2020). Hongbin Pei, Bingzhe Wei, Kevin Chen-Chuan Chang, Yu Lei, and Bo Yang. 2020. Geom-gcn: Geometric graph convolutional networks. arXiv preprint arXiv:2002.05287 (2020)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000073"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1639537.1639542"},{"key":"e_1_3_2_1_34_1","volume-title":"Dropedge: Towards deep graph convolutional networks on node classification. arXiv preprint arXiv:1907.10903","author":"Rong Yu","year":"2019","unstructured":"Yu Rong , Wenbing Huang , Tingyang Xu , and Junzhou Huang . 2019 . Dropedge: Towards deep graph convolutional networks on node classification. arXiv preprint arXiv:1907.10903 (2019). Yu Rong, Wenbing Huang, Tingyang Xu, and Junzhou Huang. 2019. Dropedge: Towards deep graph convolutional networks on node classification. arXiv preprint arXiv:1907.10903 (2019)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341161.3342890"},{"key":"e_1_3_2_1_36_1","volume-title":"Markus Hagenbuchner, and Gabriele Monfardini.","author":"Scarselli Franco","year":"2008","unstructured":"Franco Scarselli , Marco Gori , Ah Chung Tsoi , Markus Hagenbuchner, and Gabriele Monfardini. 2008 . The graph neural network model. IEEE transactions on neural networks, Vol. 20 , 1 (2008), 61--80. Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and Gabriele Monfardini. 2008. The graph neural network model. IEEE transactions on neural networks, Vol. 20, 1 (2008), 61--80."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1967.21.343"},{"key":"e_1_3_2_1_38_1","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Stretcu Otilia","year":"2019","unstructured":"Otilia Stretcu , Krishnamurthy Viswanathan , Dana Movshovitz-Attias , Emmanouil Platanios , Sujith Ravi , and Andrew Tomkins . 2019 . Graph agreement models for semi-supervised learning . Advances in Neural Information Processing Systems , Vol. 32 (2019). Otilia Stretcu, Krishnamurthy Viswanathan, Dana Movshovitz-Attias, Emmanouil Platanios, Sujith Ravi, and Andrew Tomkins. 2019. Graph agreement models for semi-supervised learning. Advances in Neural Information Processing Systems, Vol. 32 (2019)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557108"},{"key":"e_1_3_2_1_40_1","volume-title":"Graph attention networks. stat","author":"Velickovic Petar","year":"2017","unstructured":"Petar Velickovic , Guillem Cucurull , Arantxa Casanova , Adriana Romero , Pietro Lio , and Yoshua Bengio . 2017. Graph attention networks. stat , Vol. 1050 ( 2017 ), 20. Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. stat, Vol. 1050 (2017), 20."},{"key":"e_1_3_2_1_41_1","volume-title":"Unifying graph convolutional neural networks and label propagation. arXiv preprint arXiv:2002.06755","author":"Wang Hongwei","year":"2020","unstructured":"Hongwei Wang and Jure Leskovec . 2020. Unifying graph convolutional neural networks and label propagation. arXiv preprint arXiv:2002.06755 ( 2020 ). Hongwei Wang and Jure Leskovec. 2020. Unifying graph convolutional neural networks and label propagation. arXiv preprint arXiv:2002.06755 (2020)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00813"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467451"},{"key":"e_1_3_2_1_44_1","volume-title":"Scalable Gromov-Wasserstein learning for graph partitioning and matching. Advances in neural information processing systems","author":"Xu Hongteng","year":"2019","unstructured":"Hongteng Xu , Dixin Luo , and Lawrence Carin . 2019a. Scalable Gromov-Wasserstein learning for graph partitioning and matching. Advances in neural information processing systems , Vol. 32 ( 2019 ). Hongteng Xu, Dixin Luo, and Lawrence Carin. 2019a. Scalable Gromov-Wasserstein learning for graph partitioning and matching. Advances in neural information processing systems, Vol. 32 (2019)."},{"key":"e_1_3_2_1_45_1","volume-title":"International conference on machine learning. PMLR, 6932--6941","author":"Xu Hongteng","year":"2019","unstructured":"Hongteng Xu , Dixin Luo , Hongyuan Zha , and Lawrence Carin Duke . 2019 b. Gromov-wasserstein learning for graph matching and node embedding . In International conference on machine learning. PMLR, 6932--6941 . Hongteng Xu, Dixin Luo, Hongyuan Zha, and Lawrence Carin Duke. 2019b. Gromov-wasserstein learning for graph matching and node embedding. In International conference on machine learning. PMLR, 6932--6941."},{"key":"e_1_3_2_1_46_1","volume-title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu , Weihua Hu , Jure Leskovec , and Stefanie Jegelka . 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 ( 2018 ). Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16586"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Liang Yang Fan Wu Yingkui Wang Junhua Gu and Yuanfang Guo. 2019. Masked Graph Convolutional Network. In IJCAI. 4070--4077.  Liang Yang Fan Wu Yingkui Wang Junhua Gu and Yuanfang Guo. 2019. Masked Graph Convolutional Network. In IJCAI. 4070--4077.","DOI":"10.24963\/ijcai.2019\/565"},{"key":"e_1_3_2_1_49_1","volume-title":"Graph Pointer Neural Networks. arXiv preprint arXiv:2110.00973","author":"Yang Tianmeng","year":"2021","unstructured":"Tianmeng Yang , Yujing Wang , Zhihan Yue , Yaming Yang , Yunhai Tong , and Jing Bai . 2021b. Graph Pointer Neural Networks. arXiv preprint arXiv:2110.00973 ( 2021 ). Tianmeng Yang, Yujing Wang, Zhihan Yue, Yaming Yang, Yunhai Tong, and Jing Bai. 2021b. Graph Pointer Neural Networks. arXiv preprint arXiv:2110.00973 (2021)."},{"key":"e_1_3_2_1_50_1","volume-title":"Gnnexplainer: Generating explanations for graph neural networks. Advances in neural information processing systems","author":"Ying Zhitao","year":"2019","unstructured":"Zhitao Ying , Dylan Bourgeois , Jiaxuan You , Marinka Zitnik , and Jure Leskovec . 2019 . Gnnexplainer: Generating explanations for graph neural networks. Advances in neural information processing systems , Vol. 32 (2019). Zhitao Ying, Dylan Bourgeois, Jiaxuan You, Marinka Zitnik, and Jure Leskovec. 2019. Gnnexplainer: Generating explanations for graph neural networks. Advances in neural information processing systems, Vol. 32 (2019)."},{"key":"e_1_3_2_1_51_1","volume-title":"Pairnorm: Tackling oversmoothing in gnns. arXiv preprint arXiv:1909.12223","author":"Zhao Lingxiao","year":"2019","unstructured":"Lingxiao Zhao and Leman Akoglu . 2019 . Pairnorm: Tackling oversmoothing in gnns. arXiv preprint arXiv:1909.12223 (2019). Lingxiao Zhao and Leman Akoglu. 2019. Pairnorm: Tackling oversmoothing in gnns. arXiv preprint arXiv:1909.12223 (2019)."},{"key":"e_1_3_2_1_52_1","volume-title":"International Conference on Machine Learning. PMLR, 11458--11468","author":"Zheng Cheng","year":"2020","unstructured":"Cheng Zheng , Bo Zong , Wei Cheng , Dongjin Song , Jingchao Ni , Wenchao Yu , Haifeng Chen , and Wei Wang . 2020 . Robust graph representation learning via neural sparsification . In International Conference on Machine Learning. PMLR, 11458--11468 . Cheng Zheng, Bo Zong, Wei Cheng, Dongjin Song, Jingchao Ni, Wenchao Yu, Haifeng Chen, and Wei Wang. 2020. Robust graph representation learning via neural sparsification. In International Conference on Machine Learning. PMLR, 11458--11468."},{"key":"e_1_3_2_1_53_1","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume":"33","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 . Advances in Neural Information Processing Systems , Vol. 33 (2020), 7793 -- 7804 . 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. Advances in Neural Information Processing Systems, Vol. 33 (2020), 7793--7804.","journal-title":"Advances in Neural Information Processing Systems"}],"event":{"name":"CIKM '22: The 31st ACM International Conference on Information and Knowledge Management","location":"Atlanta GA USA","acronym":"CIKM '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 31st ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557324","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3511808.3557324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:29Z","timestamp":1750182569000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":53,"alternative-id":["10.1145\/3511808.3557324","10.1145\/3511808"],"URL":"https:\/\/doi.org\/10.1145\/3511808.3557324","relation":{},"subject":[],"published":{"date-parts":[[2022,10,17]]},"assertion":[{"value":"2022-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}