{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T06:57:58Z","timestamp":1784185078624,"version":"3.55.0"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Shanghai Municipal Science and Technology Major Project","award":["2018SHZDZX01"],"award-info":[{"award-number":["2018SHZDZX01"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62176059"],"award-info":[{"award-number":["62176059"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Zhangjiang Laboratory (ZJLab), Shanghai Center for Brain Science and Brain-Inspired Technology"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1109\/tnnls.2023.3267902","type":"journal-article","created":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T17:29:54Z","timestamp":1684344594000},"page":"13383-13396","source":"Crossref","is-referenced-by-count":34,"title":["Exploiting Neighbor Effect: Conv-Agnostic GNN Framework for Graphs With Heterophily"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5625-5729","authenticated-orcid":false,"given":"Jie","family":"Chen","sequence":"first","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Information Processing and the School of Computer Science, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8220-0000","authenticated-orcid":false,"given":"Shouzhen","family":"Chen","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Information Processing and the School of Computer Science, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9803-0256","authenticated-orcid":false,"given":"Junbin","family":"Gao","sequence":"additional","affiliation":[{"name":"Discipline of Business Analytics, The University of Sydney Business School, The University of Sydney, Camperdown, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2671-7483","authenticated-orcid":false,"given":"Zengfeng","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Data Science, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5924-3360","authenticated-orcid":false,"given":"Junping","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Information Processing and the School of Computer Science, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0892-1213","authenticated-orcid":false,"given":"Jian","family":"Pu","sequence":"additional","affiliation":[{"name":"Institute of Science and Technology for Brain-Inspired Intelligence, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref2","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.06.006"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref5","article-title":"Revisiting graph neural networks: All we have is low-pass filters","author":"Hoang","year":"2019","journal-title":"arXiv:1905.09550"},{"key":"ref6","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Kipf"},{"key":"ref7","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Zhu"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3144670"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2021.3106392"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3165618"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3060872"},{"key":"ref12","article-title":"Graph neural networks for graphs with heterophily: A survey","author":"Zheng","year":"2022","journal-title":"arXiv:2202.07082"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM54844.2022.00169"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17332"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9747635"},{"key":"ref17","first-page":"1","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Pei"},{"key":"ref18","first-page":"1","article-title":"Revisiting heterophily for graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Luan"},{"key":"ref19","first-page":"1","article-title":"Adaptive universal generalized pagerank graph neural network","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Chien"},{"key":"ref20","first-page":"1","article-title":"Is homophily a necessity for graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Ma"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/9781139207010"},{"key":"ref22","article-title":"Spectral networks and locally connected networks on graphs","author":"Bruna","year":"2013","journal-title":"arXiv:1312.6203"},{"key":"ref23","first-page":"1","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Defferrard"},{"key":"ref24","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Xu"},{"key":"ref25","first-page":"1","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Klicpera"},{"key":"ref26","first-page":"1","article-title":"A fair comparison of graph neural networks for graph classification","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Errica"},{"key":"ref27","article-title":"Relational inductive biases, deep learning, and graph networks","author":"Battaglia","year":"2018","journal-title":"arXiv:1806.01261"},{"key":"ref28","article-title":"Improving graph attention networks with large margin-based constraints","author":"Wang","year":"2019","journal-title":"arXiv:1910.11945"},{"key":"ref29","first-page":"1","article-title":"Measuring and improving the use of graph information in graph neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Hou"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3161453"},{"key":"ref31","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref32","first-page":"14239","article-title":"BernNet: Learning arbitrary graph spectral filters via Bernstein approximation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"He"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3134200"},{"key":"ref34","first-page":"22667","article-title":"SLAPS: Self-supervision improves structure learning for graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Fatemi"},{"key":"ref35","first-page":"21","article-title":"MixHop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Abu-El-Haija"},{"key":"ref36","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref37","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Veli\u010dkovi\u0107"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(89)90020-8"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(91)90009-T"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1505.00387"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235192"},{"key":"ref44","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref45","first-page":"1","article-title":"Simple spectral graph convolution","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Zhu"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00936"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnab014"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557108"},{"key":"ref50","article-title":"Batch normalization: Accelerating deep network training by reducing internal covariate shift","author":"Ioffe","year":"2015","journal-title":"arXiv:1502.03167"},{"key":"ref51","article-title":"Layer normalization","author":"Ba","year":"2016","journal-title":"arXiv:1607.06450"},{"key":"ref52","first-page":"1972","article-title":"Learning discrete structures for graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Franceschi"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/550"},{"key":"ref54","first-page":"19314","article-title":"Iterative deep graph learning for graph neural networks: Better and robust node embeddings","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Chen"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/10707065\/10128758.pdf?arnumber=10128758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T01:49:47Z","timestamp":1733881787000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10128758\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":54,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2023.3267902","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10]]}}}