{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:21:12Z","timestamp":1771698072480,"version":"3.50.1"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council (ARC) Future Fellowship","doi-asserted-by":"publisher","award":["FT210100097"],"award-info":[{"award-number":["FT210100097"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1109\/tnnls.2022.3186103","type":"journal-article","created":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T19:33:26Z","timestamp":1657827206000},"page":"2003-2013","source":"Crossref","is-referenced-by-count":31,"title":["TraverseNet: Unifying Space and Time in Message Passing for Traffic Forecasting"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4450-7738","authenticated-orcid":false,"given":"Zonghan","family":"Wu","sequence":"first","affiliation":[{"name":"Center for Artificial Intelligence, FEIT, University of Technology Sydney, Ultimo, NSW, Australia"}]},{"given":"Da","family":"Zheng","sequence":"additional","affiliation":[{"name":"Amazon, Seattle, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0794-527X","authenticated-orcid":false,"given":"Shirui","family":"Pan","sequence":"additional","affiliation":[{"name":"Department of Data Science and AI, Monash University, Clayton, VIC, Australia"}]},{"given":"Quan","family":"Gan","sequence":"additional","affiliation":[{"name":"Amazon, Seattle, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3740-9515","authenticated-orcid":false,"given":"Guodong","family":"Long","sequence":"additional","affiliation":[{"name":"Center for Artificial Intelligence, FEIT, University of Technology Sydney, Ultimo, NSW, Australia"}]},{"given":"George","family":"Karypis","sequence":"additional","affiliation":[{"name":"Amazon, Seattle, WA, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04167-0_33"},{"key":"ref2","article-title":"Diffusion convolutional recurrent neural network: Data-driven traffic forecasting","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Li"},{"key":"ref3","article-title":"GaAN: Gated attention networks for learning on large and spatiotemporal graphs","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Zhang"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12328"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/505"},{"key":"ref6","first-page":"5998","article-title":"Attention is all you need","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Vaswani"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1458"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301922"},{"key":"ref9","first-page":"1","article-title":"STGRAT: A spatio-temporal graph attention network for traffic forecasting","volume-title":"Proc. Conf. Inf. Knowl. Manage.","author":"Park"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380186"},{"key":"ref11","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Kipf"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2879624"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3054830"},{"key":"ref14","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref15","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. ICML","author":"Gilmer"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref17","first-page":"6316","article-title":"Contrastive graph Poisson networks: Semi-supervised learning with extremely limited labels","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Wan"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2022.3172903"},{"key":"ref19","article-title":"Trustworthy graph neural networks: Aspects, methods and trends","volume-title":"arXiv:2205.07424","author":"Zhang","year":"2022"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.576"},{"key":"ref21","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. 5th Int. Conf. Learn. Represent.","author":"Velickovic"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330897"},{"key":"ref23","first-page":"13354","article-title":"Diffusion improves graph learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Klicpera"},{"key":"ref24","article-title":"Multi-hop attention graph neural network","volume-title":"arXiv:2009.14332","author":"Wang","year":"2020"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2022.3221989"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330884"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33018561"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/264"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403118"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5470"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5477"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5438"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16542"},{"key":"ref34","article-title":"Spatio-temporal graph scattering transform","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Pan"},{"key":"ref35","article-title":"Space-time graph neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Hadou"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/DSLW51110.2021.9523412"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2019.8852131"},{"key":"ref38","article-title":"Graph edit networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Paassen"},{"key":"ref39","article-title":"Deep graph library: A graph-centric, highly-performant package for graph neural networks","volume-title":"arXiv:1909.01315","author":"Wang","year":"2019"},{"key":"ref40","article-title":"Sequence to sequence learning with neural networks","volume-title":"arXiv:1409.3215","author":"Sutskever","year":"2014"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/d14-1179"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/10422842\/09829541.pdf?arnumber=9829541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T01:44:39Z","timestamp":1733881479000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9829541\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":41,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2022.3186103","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2]]}}}