{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:27:45Z","timestamp":1773246465610,"version":"3.50.1"},"reference-count":48,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:00:00Z","timestamp":1728172800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:00:00Z","timestamp":1728172800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,10,6]]},"DOI":"10.1109\/smc54092.2024.10831490","type":"proceedings-article","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:39:20Z","timestamp":1737398360000},"page":"1544-1551","source":"Crossref","is-referenced-by-count":2,"title":["Incorporating Heterophily into Graph Neural Networks for Graph Classification"],"prefix":"10.1109","author":[{"given":"Jiayi","family":"Yang","sequence":"first","affiliation":[{"name":"College of Electronic and Information Engineering, Tongji University,Shanghai,China,201804"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sourav","family":"Medya","sequence":"additional","affiliation":[{"name":"University of Illinois,Department of Computer Science,Chicago,IL,USA,60607"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Ye","sequence":"additional","affiliation":[{"name":"College of Electronic and Information Engineering, Tongji University,Shanghai,China,201804"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Breaking the limits of message passing graph neural networks","author":"Balcilar","year":"2021","journal-title":"ICML. PMLR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3331445"},{"key":"ref4","article-title":"GRAND: graph neural diffusion","author":"Chamberlain","year":"2021","journal-title":"ICML. PMLR"},{"key":"ref5","article-title":"Simplified graph convolution with heterophily","author":"Chanpuriya","journal-title":"NeurIPS, 2022"},{"key":"ref6","article-title":"Adaptive universal generalized pagerank graph neural network","author":"Chien","year":"2021","journal-title":"ICLR. OpenReview.net"},{"key":"ref7","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","author":"Defferrard","journal-title":"NeurIPS, 2016"},{"key":"ref8","article-title":"Relational attention: Generalizing transformers for graph-structured tasks","author":"Diao","journal-title":"ICLR, 2023"},{"key":"ref9","article-title":"A fair comparison of graph neural networks for graph classification","author":"Errica","year":"2020","journal-title":"ICLR. OpenReview.net"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i6.20615"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-020-09990-9"},{"key":"ref13","article-title":"Neural message passing for quantum chemistry","author":"Gilmer","year":"2017","journal-title":"ICML. PMLR"},{"key":"ref14","article-title":"Inductive representation learning on large graphs","author":"Hamilton","journal-title":"NeurIPS, 2017"},{"key":"ref15","volume-title":"Ogb-lsc: A large-scale challenge for machine learning on graphs","author":"Hu","year":"2021"},{"key":"ref16","volume-title":"Structpool: Structured graph pooling via conditional random fields","year":"2020"},{"key":"ref17","article-title":"Marginalized kernels between labeled graphs","author":"Kashima","journal-title":"ICML, 2003"},{"key":"ref18","first-page":"14582","article-title":"Pure transformers are powerful graph learners","author":"Kim","year":"2022","journal-title":"NeurIPS"},{"key":"ref19","article-title":"Adam: A method for stochastic optimization","author":"Kingma","journal-title":"ICLR, 2015"},{"key":"ref20","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","journal-title":"ICLR, 2017"},{"key":"ref21","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","author":"Leman","year":"1968","journal-title":"NauchnoTechnicheskaya Info rmatsiya"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i12.29246"},{"key":"ref23","article-title":"Finding global homophily in graph neural networks when meeting heterophily","volume-title":"ICML","author":"Li","year":"2022"},{"key":"ref24","first-page":"1299","article-title":"Unsu-pervised hierarchical graph pooling via substructure-sensitive mutual information maximization","volume-title":"CIKM","author":"Liu","year":"2022"},{"key":"ref25","article-title":"Revisiting heterophily for graph neural networks","author":"Luan","journal-title":"NeurIPS, 2022"},{"key":"ref26","article-title":"Provably powerful graph networks","author":"Maron","journal-title":"Advances in Neural Information Processing Systems, 2019"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5517-9"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-021-06098-0"},{"key":"ref31","article-title":"Geom-gcn: Geometric graph convolutional networks","author":"Pei","year":"2020","journal-title":"ICLR. OpenReview.net"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref33","article-title":"Fast subtree kernels on graphs","volume-title":"NeurIPS","author":"Shervashidze","year":"2009"},{"key":"ref34","article-title":"Weisfeiler-Iehman graph kernels","author":"Shervashidze","journal-title":"JMLR, 2011"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467373"},{"key":"ref36","first-page":"15811","article-title":"Towards scale-invariant graph-related problem solving by iterative homogeneous gnns","author":"Tang","year":"2020","journal-title":"NeurIPS"},{"key":"ref37","article-title":"Graph attention networks","volume-title":"ICLR","author":"Velickovic","year":"2017"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120427"},{"key":"ref39","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2019","journal-title":"ICLR. OpenReview.net"},{"key":"ref40","article-title":"Representation learning on graphs with jumping knowledge networks","author":"Xu","year":"2018","journal-title":"ICML. PMLR"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM54844.2022.00169"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17268"},{"key":"ref43","first-page":"28877","author":"Ying","year":"2021","journal-title":"Do transformers really perform badly for graph representation?"},{"key":"ref44","article-title":"Hierarchical graph representation learning with differentiable pooling","author":"Ying","journal-title":"NeurIPS, 2018"},{"key":"ref45","article-title":"Deep sets","author":"Zaheer","year":"2017","journal-title":"NeurIPS"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref47","article-title":"Graph neural networks for graphs with heterophily: A survey","author":"Zheng","year":"2022","journal-title":"arXiv preprint"},{"key":"ref48","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","author":"Zhu","journal-title":"NeurIPS, 2020"}],"event":{"name":"2024 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","location":"Kuching, Malaysia","start":{"date-parts":[[2024,10,6]]},"end":{"date-parts":[[2024,10,10]]}},"container-title":["2024 IEEE International Conference on Systems, Man, and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10830919\/10830920\/10831490.pdf?arnumber=10831490","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T06:32:19Z","timestamp":1737441139000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10831490\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,6]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/smc54092.2024.10831490","relation":{},"subject":[],"published":{"date-parts":[[2024,10,6]]}}}