{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T18:27:16Z","timestamp":1781375236931,"version":"3.54.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62402326"],"award-info":[{"award-number":["62402326"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Scientific Research Project of Higher Education Institutions of Liaoning Provincial Department of Education","award":["LJ212410142146"],"award-info":[{"award-number":["LJ212410142146"]}]},{"DOI":"10.13039\/501100005270","name":"Joint Fund General Project of Liaoning Provincial Department of Science and Technology","doi-asserted-by":"publisher","award":["2024-BSLH-165"],"award-info":[{"award-number":["2024-BSLH-165"]}],"id":[{"id":"10.13039\/501100005270","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3633711","type":"journal-article","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T18:42:17Z","timestamp":1763404937000},"page":"197277-197288","source":"Crossref","is-referenced-by-count":1,"title":["SEAGNN: A Multi-Source Heterogeneous Road Network Matching Method With Enhanced Structural Awareness"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-0024-0803","authenticated-orcid":false,"given":"Guangkun","family":"Ma","sequence":"first","affiliation":[{"name":"School of Software, Shenyang University of Technology, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4575-0259","authenticated-orcid":false,"given":"Jiazhuang","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Software, Shenyang University of Technology, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhengang","family":"Ren","sequence":"additional","affiliation":[{"name":"Shenyang MXNavi Company Ltd., Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6834-9925","authenticated-orcid":false,"given":"Kun","family":"Hao","sequence":"additional","affiliation":[{"name":"School of Software, Shenyang University of Technology, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2007.05.002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3557990.3567590"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/s22041501"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi13010015"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.compenvurbsys.2021.101618"},{"key":"ref6","first-page":"3835","article-title":"Graph matching networks for learning the similarity of graph structured objects","volume-title":"Proc. 36th Int. Conf. Mach. Learn. (ICML)","author":"Li"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3678717.3691244"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref9","first-page":"40390","article-title":"SeedGNN: Graph neural network for supervised seeded graph matching","volume-title":"Proc. 40th Int. Conf. Mach. Learn. (ICML)","author":"Yu"},{"key":"ref10","article-title":"Graph matching based on a few seeds: Theoretical algorithms and graph neural network approaches","author":"Yu","year":"2023"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463031"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00238"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/a17050212"},{"key":"ref14","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"26","author":"Cuturi"},{"key":"ref15","article-title":"A review of matrix scaling and Sinkhorn\u2019s normal form for matrices and positive maps","author":"Idel","year":"2016","journal-title":"arXiv:1609.06349"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi14070275"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3283207.3283214"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482293"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3347146.3359094"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1080\/13658816.2021.2024195"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2963722"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jag.2022.102696"},{"key":"ref23","first-page":"2335","article-title":"A method of road network matching using graph embedding via improved neighbor aggregations","volume":"26","author":"Yang","year":"2024","journal-title":"J. Geo-Form. Sci."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/BigData62323.2024.10825756"},{"key":"ref25","article-title":"Fine-grained extraction of road networks via joint learning of connectivity and segmentation","author":"Xu","year":"2023","journal-title":"arXiv:2312.04744"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.48130\/dts-0024-0021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.3390\/su17083705"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s44196-025-00842-3"},{"key":"ref29","first-page":"4494","article-title":"AttnMove: History enhanced trajectory recovery via attentional network","volume-title":"Proc. AAAI Conf. Artif. Intell. (AAAI)","volume":"35","author":"Tong"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.3390\/su17094004"},{"key":"ref31","article-title":"Spatio-temporal graph dual-attention network for multi-agent prediction and tracking","author":"Li","year":"2021","journal-title":"arXiv:2102.09117"},{"key":"ref32","first-page":"82","article-title":"A generic algorithm for automatic road-network matching between different data sets","volume":"35","author":"Zhang","year":"2018","journal-title":"J. Geomatics Sci. Technol."},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00499"},{"key":"ref34","first-page":"1","article-title":"Fast differentiable sorting and ranking via optimal transport","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Blondel"},{"key":"ref35","first-page":"1","article-title":"Low-rank Sinkhorn factorization for large-scale optimal transport","volume-title":"Proc. NeurIPS","author":"Scetbon"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.3390\/a13090212"},{"issue":"78","key":"ref37","first-page":"1","article-title":"POT: Python optimal transport","volume":"22","author":"Flamary","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1080\/02693798808927897"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/34.121791"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11250978.pdf?arnumber=11250978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T05:56:15Z","timestamp":1764050175000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11250978\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3633711","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}