{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T18:55:58Z","timestamp":1791485758346,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61973273"],"award-info":[{"award-number":["61973273"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research and Development Program of Zhejiang, China","award":["2022C01018"],"award-info":[{"award-number":["2022C01018"]}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LR19F030001"],"award-info":[{"award-number":["LR19F030001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,21]]},"DOI":"10.1145\/3583780.3615195","type":"proceedings-article","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T07:45:26Z","timestamp":1697874326000},"page":"3908-3912","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Neighborhood Homophily-based Graph Convolutional Network"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7482-6524","authenticated-orcid":false,"given":"Shengbo","family":"Gong","sequence":"first","affiliation":[{"name":"Zhejiang University of Technology & Binjiang Cyberspace Security Institute of ZJUT, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5062-4183","authenticated-orcid":false,"given":"Jiajun","family":"Zhou","sequence":"additional","affiliation":[{"name":"Zhejiang University of Technology & Binjiang Cyberspace Security Institute of ZJUT, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4474-615X","authenticated-orcid":false,"given":"Chenxuan","family":"Xie","sequence":"additional","affiliation":[{"name":"Zhejiang University of Technology & Binjiang Cyberspace Security Institute of ZJUT, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1042-470X","authenticated-orcid":false,"given":"Qi","family":"Xuan","sequence":"additional","affiliation":[{"name":"Zhejiang University of Technology & Binjiang Cyberspace Security Institute of ZJUT, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"e_1_3_2_2_1_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_2_1","volume-title":"What do citation counts measure? A review of studies on citing behavior. Journal of documentation","author":"Bornmann Lutz","year":"2008","unstructured":"Lutz Bornmann and Hans-Dieter Daniel . 2008. What do citation counts measure? A review of studies on citing behavior. Journal of documentation ( 2008 ). Lutz Bornmann and Hans-Dieter Daniel. 2008. What do citation counts measure? A review of studies on citing behavior. Journal of documentation (2008)."},{"key":"e_1_3_2_2_3_1","unstructured":"Ming Chen Zhewei Wei Zengfeng Huang Bolin Ding and Yaliang Li. 2020. Simple and deep graph convolutional networks. In ICLR. PMLR 1725--1735.  Ming Chen Zhewei Wei Zengfeng Huang Bolin Ding and Yaliang Li. 2020. Simple and deep graph convolutional networks. In ICLR. PMLR 1725--1735."},{"key":"e_1_3_2_2_4_1","unstructured":"Eli Chien Jianhao Peng Pan Li and Olgica Milenkovic. 2021. Adaptive Universal Generalized PageRank Graph Neural Network. In ICLR.  Eli Chien Jianhao Peng Pan Li and Olgica Milenkovic. 2021. Adaptive Universal Generalized PageRank Graph Neural Network. In ICLR."},{"key":"e_1_3_2_2_5_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 WWW. 1550--1558.  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 WWW. 1550--1558.","DOI":"10.1145\/3485447.3512201"},{"key":"e_1_3_2_2_6_1","volume-title":"NeurIPS","volume":"30","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton , Zhitao Ying , and Jure Leskovec . 2017 . Inductive representation learning on large graphs . In NeurIPS , Vol. 30 . Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS, Vol. 30."},{"key":"e_1_3_2_2_7_1","first-page":"14239","article-title":"Bernnet: Learning arbitrary graph spectral filters via bernstein approximation","volume":"34","author":"He Mingguo","year":"2021","unstructured":"Mingguo He , Zhewei Wei , Hongteng Xu , 2021 . Bernnet: Learning arbitrary graph spectral filters via bernstein approximation . In NeurIPS , Vol. 34. 14239 -- 14251 . Mingguo He, Zhewei Wei, Hongteng Xu, et al. 2021. Bernnet: Learning arbitrary graph spectral filters via bernstein approximation. In NeurIPS, Vol. 34. 14239--14251.","journal-title":"NeurIPS"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Mengda Huang Yang Liu Xiang Ao Kuan Li Jianfeng Chi Jinghua Feng Hao Yang and Qing He. 2022. Auc-oriented graph neural network for fraud detection. In WWW. 1311--1321.  Mengda Huang Yang Liu Xiang Ao Kuan Li Jianfeng Chi Jinghua Feng Hao Yang and Qing He. 2022. Auc-oriented graph neural network for fraud detection. In WWW. 1311--1321.","DOI":"10.1145\/3485447.3512178"},{"key":"e_1_3_2_2_9_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma and Jimmy Ba . 2014 . Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014). Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_2_10_1","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_11_1","unstructured":"Johannes Klicpera Stefan Wei\u00dfenberger and Stephan G\u00fcnnemann. 2019. Diffusion improves graph learning. In NeurIPS. 13366--13378.  Johannes Klicpera Stefan Wei\u00dfenberger and Stephan G\u00fcnnemann. 2019. Diffusion improves graph learning. In NeurIPS. 13366--13378."},{"key":"e_1_3_2_2_12_1","unstructured":"Qimai Li Zhichao Han and Xiao-Ming Wu. 2018. Deeper insights into graph convolutional networks for semi-supervised learning. In AAAI.  Qimai Li Zhichao Han and Xiao-Ming Wu. 2018. Deeper insights into graph convolutional networks for semi-supervised learning. In AAAI."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3134200"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539483"},{"key":"e_1_3_2_2_15_1","unstructured":"Sitao Luan Chenqing Hua Qincheng Lu Jiaqi Zhu Mingde Zhao Shuyuan Zhang Xiao-Wen Chang and Doina Precup. 2022. Revisiting Heterophily For Graph Neural Networks. In NeurIPS.  Sitao Luan Chenqing Hua Qincheng Lu Jiaqi Zhu Mingde Zhao Shuyuan Zhang Xiao-Wen Chang and Doina Precup. 2022. Revisiting Heterophily For Graph Neural Networks. In NeurIPS."},{"key":"e_1_3_2_2_16_1","unstructured":"Yao Ma Xiaorui Liu Neil Shah and Jiliang Tang. 2021. Is Homophily a Necessity for Graph Neural Networks?. In ICLR.  Yao Ma Xiaorui Liu Neil Shah and Jiliang Tang. 2021. Is Homophily a Necessity for Graph Neural Networks?. In ICLR."},{"key":"e_1_3_2_2_17_1","unstructured":"Kenta Oono and Taiji Suzuki. 2019. Graph Neural Networks Exponentially Lose Expressive Power for Node Classification. In ICLR.  Kenta Oono and Taiji Suzuki. 2019. Graph Neural Networks Exponentially Lose Expressive Power for Node Classification. In ICLR."},{"key":"e_1_3_2_2_18_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_19_1","unstructured":"Oleg Platonov Denis Kuznedelev Michael Diskin Artem Babenko and Liudmila Prokhorenkova. 2023. A critical look at the evaluation of GNNs under heterophily: Are we really making progress?. In ICLR.  Oleg Platonov Denis Kuznedelev Michael Diskin Artem Babenko and Liudmila Prokhorenkova. 2023. A critical look at the evaluation of GNNs under heterophily: Are we really making progress?. In ICLR."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2020.01.021"},{"key":"e_1_3_2_2_21_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 SIGKDD.  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 SIGKDD.","DOI":"10.1145\/3447548.3467373"},{"key":"e_1_3_2_2_22_1","unstructured":"Petar Velivc kovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2018. Graph attention networks. In ICLR.  Petar Velivc kovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2018. Graph attention networks. In ICLR."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Tao Wang Di Jin Rui Wang Dongxiao He and Yuxiao Huang. 2022. 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. 2022. 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_24_1","volume-title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks","author":"Yan Yujun","unstructured":"Yujun Yan , Milad Hashemi , Kevin Swersky , Yaoqing Yang , and Danai Koutra . 2022. Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks . In ICDM. IEEE , 1287--1292. Yujun Yan, Milad Hashemi, Kevin Swersky, Yaoqing Yang, and Danai Koutra. 2022. Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. In ICDM. IEEE, 1287--1292."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Wentao Zhang Zeang Sheng Ziqi Yin Yuezihan Jiang Yikuan Xia Jun Gao Zhi Yang and Bin Cui. 2022. Model Degradation Hinders Deep Graph Neural Networks. In SIGKDD.  Wentao Zhang Zeang Sheng Ziqi Yin Yuezihan Jiang Yikuan Xia Jun Gao Zhi Yang and Bin Cui. 2022. Model Degradation Hinders Deep Graph Neural Networks. In SIGKDD.","DOI":"10.1145\/3534678.3539374"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Jiong Zhu Ryan A Rossi Anup Rao Tung Mai Nedim Lipka Nesreen K Ahmed and Danai Koutra. 2021. Graph neural networks with heterophily. In AAAI.  Jiong Zhu Ryan A Rossi Anup Rao Tung Mai Nedim Lipka Nesreen K Ahmed and Danai Koutra. 2021. Graph neural networks with heterophily. In AAAI.","DOI":"10.1609\/aaai.v35i12.17332"},{"key":"e_1_3_2_2_27_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 . In NeurIPS , Vol. 33. 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. In NeurIPS, Vol. 33. 7793--7804.","journal-title":"NeurIPS"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.03.057"}],"event":{"name":"CIKM '23: The 32nd ACM International Conference on Information and Knowledge Management","location":"Birmingham United Kingdom","acronym":"CIKM '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 32nd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3615195","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583780.3615195","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:43Z","timestamp":1750178203000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3615195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,21]]},"references-count":28,"alternative-id":["10.1145\/3583780.3615195","10.1145\/3583780"],"URL":"https:\/\/doi.org\/10.1145\/3583780.3615195","relation":{},"subject":[],"published":{"date-parts":[[2023,10,21]]},"assertion":[{"value":"2023-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}