{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T17:36:17Z","timestamp":1794332177534,"version":"4.9.0"},"reference-count":69,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ARC","award":["DP230101445"],"award-info":[{"award-number":["DP230101445"]}]},{"name":"ARC","award":["DP210101393"],"award-info":[{"award-number":["DP210101393"]}]},{"name":"ARC","award":["DP200101116"],"award-info":[{"award-number":["DP200101116"]}]},{"name":"ARC","award":["FT210100303"],"award-info":[{"award-number":["FT210100303"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1109\/tkde.2023.3279920","type":"journal-article","created":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T17:58:15Z","timestamp":1685037495000},"page":"281-295","source":"Crossref","is-referenced-by-count":11,"title":["Neural Similarity Search on Supergraph Containment"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3158-9586","authenticated-orcid":false,"given":"Hanchen","family":"Wang","sequence":"first","affiliation":[{"name":"Zhejiang Gongshang University, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2032-7727","authenticated-orcid":false,"given":"Jianke","family":"Yu","sequence":"additional","affiliation":[{"name":"Zhejiang Gongshang University, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3554-3219","authenticated-orcid":false,"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3908-6545","authenticated-orcid":false,"given":"Chen","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang Gongshang University, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6572-2600","authenticated-orcid":false,"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-7225","authenticated-orcid":false,"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368955"},{"key":"ref4","first-page":"938","article-title":"Graph indexing: Tree+ delta<= graph","volume-title":"Proc. 33rd Int. Conf. Very Large Data Bases","author":"Zhao"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353369"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402726"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021929"},{"key":"ref8","first-page":"926","article-title":"Towards graph containment search and indexing","volume-title":"Proc. ACM 33rd Int. Conf. Very Large Data Bases","author":"Chen"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13818-8_26"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516385"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397241"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383171"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/9781118103746"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl571"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_10"},{"key":"ref17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0212-8"},{"key":"ref19","first-page":"6351","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Dai"},{"key":"ref20","first-page":"537","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","volume-title":"Proc. 32nd Int. Conf. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref21","first-page":"3835","article-title":"Graph matching networks for learning the similarity of graph structured objects","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref22","article-title":"Neural subgraph matching","author":"Lou","year":"2020"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403247"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457289"},{"key":"ref25","first-page":"10 383","article-title":"Can graph neural networks count substructures?","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526163"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/183"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-021-00878-3"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467332"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380581"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498237"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447846"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247650"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2906608"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661872"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2499201"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-021-00900-8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-022-01015-4"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/168"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-022-01009-2"},{"key":"ref41","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"key":"ref42","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref43","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref45","first-page":"15580","article-title":"Exact combinatorial optimization with graph convolutional neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gasse"},{"key":"ref46","first-page":"1","article-title":"Learning space partitions for nearest neighbor search","volume-title":"Proc. 8th Int. Conf. Learn. Representations","author":"Dong"},{"key":"ref47","first-page":"6659","article-title":"Erdos goes neural: An unsupervised learning framework for combinatorial optimization on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Karalias"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5723"},{"key":"ref49","first-page":"588","article-title":"GLSearch: Maximum common subgraph detection via learning to search","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bai"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00221"},{"key":"ref51","volume-title":"Reinforcement Learning: An Introduction","author":"Sutton","year":"2018"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400"},{"key":"ref54","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal Transport: Old and New","volume":"338","author":"Villani","year":"2009"},{"key":"ref55","first-page":"6932","article-title":"Gromov-Wasserstein learning for graph matching and node embedding","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref56","first-page":"3052","article-title":"Scalable Gromov-Wasserstein learning for graph partitioning and matching","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Xu"},{"key":"ref57","first-page":"214","article-title":"Wasserstein generative adversarial networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Arjovsky"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2017.08.015"},{"key":"ref59","article-title":"Wasserstein GAN","author":"Arjovsky","year":"2017"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jpca.1c02419"},{"key":"ref62","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018"},{"key":"ref63","article-title":"Topology adaptive graph convolutional networks","author":"Du","year":"2017"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"issue":"9","key":"ref65","first-page":"2539","article-title":"Weisfeiler-Lehman graph kernels","volume":"12","author":"Shervashidze","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref66","first-page":"21824","article-title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Morris"},{"key":"ref67","article-title":"Weisfeiler and Leman go machine learning: The story so far","author":"Morris","year":"2021"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20725"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25610"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10348031\/10135129.pdf?arnumber=10135129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T17:39:16Z","timestamp":1715103556000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10135129\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":69,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3279920","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1]]}}}