{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T02:04:00Z","timestamp":1755223440427,"version":"3.43.0"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2023YFB4502300"],"award-info":[{"award-number":["2023YFB4502300"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62402503","62025208","62421002"],"award-info":[{"award-number":["62402503","62025208","62421002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1109\/tkde.2025.3583003","type":"journal-article","created":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T13:35:10Z","timestamp":1750772110000},"page":"5298-5310","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchy-Aware Neural Subgraph Matching With Enhanced Similarity Measure"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-6424-2622","authenticated-orcid":false,"given":"Zhouyang","family":"Liu","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, National University of Defense Technology, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8966-7869","authenticated-orcid":false,"given":"Ning","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Information and Communication, National University of Defense Technology, Wuhan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2939-2541","authenticated-orcid":false,"given":"Yixin","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, National University of Defense Technology, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2036-4894","authenticated-orcid":false,"given":"Jiezhong","family":"He","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, National University of Defense Technology, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5639-7882","authenticated-orcid":false,"given":"Menghan","family":"Jia","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, National University of Defense Technology, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9743-2034","authenticated-orcid":false,"given":"Dongsheng","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, National University of Defense Technology, Changsha, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref2","first-page":"149","article-title":"An improved algorithm for matching large graphs","volume-title":"Proc. 3rd IAPR-TC15 Workshop Graphbased Representations Pattern Recognit.","author":"Cordella","year":"2001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl571"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"ref5","first-page":"337","article-title":"Turboiso: Towards ultrafast and robust subgraph isomorphism search in large graph databases","volume-title":"Proc. ACM SIGMOD Int. Conf. Manage. Data","author":"Han"},{"issue":"S-7","key":"ref6","article-title":"A subgraph isomorphism algorithm and its application to biochemical data","volume":"14","author":"Bonnici","year":"2013","journal-title":"BMC Bioinform."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2696940"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-19212-9_2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"article-title":"Neural subgraph matching","year":"2020","author":"Ying","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20784"},{"key":"ref13","first-page":"22454","article-title":"D2Match: Leveraging deep learning and degeneracy for subgraph matching","volume-title":"Proc. 40th Int. Conf. Mach. Learn.","author":"Liu"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S1079898600003358"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2016.7840663"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186115"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247666"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1316874.1316897"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536263"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00075"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989418"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448952"},{"article-title":"Order-embeddings of images and language","volume-title":"Proc. 4th Int. Conf. Learn. Representations","author":"Vendrov","key":"ref23"},{"article-title":"How powerful are graph neural networks","year":"2019","author":"Xu","key":"ref24"},{"key":"ref25","first-page":"3835","article-title":"Graph matching networks for learning the similarity of graph structured objects","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290967"},{"key":"ref27","first-page":"32112","article-title":"Maximum common subgraph guided graph retrieval: Late and early interaction networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Roy"},{"key":"ref28","first-page":"22518","article-title":"GREED: A neural framework for learning graph distance functions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ranjan"},{"key":"ref29","first-page":"30181","article-title":"Efficient graph similarity computation with alignment regularization","volume-title":"Proc. 36th Int. Conf. Neural Inf. Process. Syst.","author":"Zhuo"},{"article-title":"TUDataset: A collection of benchmark datasets for learning with graphs","volume-title":"Proc. 2020 Workshop Graph Representation Learn. Beyond (GRL 2020)","author":"Morris","key":"ref30"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380581"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.14778\/3425879.3425888"},{"key":"ref35","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hu"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11119623\/11049885.pdf?arnumber=11049885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T20:50:20Z","timestamp":1754945420000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11049885\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":35,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3583003","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}