{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:09:55Z","timestamp":1770271795306,"version":"3.49.0"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","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:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100007224","name":"Vietnam National Foundation for Science and Technology Development","doi-asserted-by":"publisher","award":["IZVSZ2.203310"],"award-info":[{"award-number":["IZVSZ2.203310"]}],"id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]},{"name":"master\u2019s and Ph.D. Scholarship Programme of Vingroup Innovation Foundation","award":["VINIF.2022.ThS.023"],"award-info":[{"award-number":["VINIF.2022.ThS.023"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3458050","type":"journal-article","created":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T18:37:31Z","timestamp":1726079851000},"page":"130474-130492","source":"Crossref","is-referenced-by-count":2,"title":["Explainable Neural Subgraph Matching With Learnable Multi-Hop Attention"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9638-8289","authenticated-orcid":false,"given":"Duc Q.","family":"Nguyen","sequence":"first","affiliation":[{"name":"Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology—VNU-HCM, Ho Chi Minh City, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6050-0774","authenticated-orcid":false,"given":"Thanh","family":"Toan Nguyen","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, HUTECH University, Ho Chi Minh City, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3099-2712","authenticated-orcid":false,"given":"Jun","family":"Jo","sequence":"additional","affiliation":[{"name":"School of Information and Communication Technology, Griffith University, Southport, QLD, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6368-4399","authenticated-orcid":false,"given":"Florent","family":"Poux","sequence":"additional","affiliation":[{"name":"Department of Geography, Faculty of Sciences, University of Liège, Liège, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shikha","family":"Anirban","sequence":"additional","affiliation":[{"name":"School of Information Technology, College of Science, Technology, Engineering and Mathematics, Murdoch University, Murdoch, WA, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0467-6254","authenticated-orcid":false,"given":"Tho T.","family":"Quan","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology—VNU-HCM, Ho Chi Minh City, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00548-x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3160710"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2875262"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/s43588-023-00503-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3022850"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s43588-023-00558-4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/s43588-023-00530-2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20784"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3060385"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"ref11","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"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"ref15","article-title":"Neural subgraph matching","author":"Ying","year":"2020","journal-title":"arXiv:2007.03092"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20725"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1304"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.1600028"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/425"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103573"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103535"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.103004"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90133-5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457265"},{"key":"ref26","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1990"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.102901"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.102953"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3378094"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3268212"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00519"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3187455"},{"key":"ref34","first-page":"37511","article-title":"Rethinking explaining graph neural networks via non-parametric subgraph matching","volume-title":"Proc. 40th Int. Conf. Mach. Learn.","volume":"202","author":"Wu"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103571"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403085"},{"key":"ref37","first-page":"12225","article-title":"PGM-explainer: Probabilistic graphical model explanations for graph neural networks","volume-title":"Proc. 34th Int. Conf. Neural Inf. Process. Syst.","author":"Vu"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3236028"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2980257"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-020-0360-y"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2914651"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-020-00236-4"},{"key":"ref43","first-page":"1","article-title":"Convolutional set matching for graph similarity","volume-title":"Proc. Neural Inf. Process. Syst. Relational Represent. Learn. Workshop","author":"Bai"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jcim.9b00387"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1166"},{"key":"ref46","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Veli\u010dkovi\u0107"},{"key":"ref47","first-page":"1","article-title":"Predict then propagate: Graph neural networks meet personalized PageRank","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Gasteiger"},{"key":"ref48","article-title":"Efficient algorithms for personalized PageRank","author":"Lofgren","year":"2015"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1406.1078"},{"key":"ref50","first-page":"1","article-title":"TUDataset: A collection of benchmark datasets for learning with graphs","volume-title":"Proc. ICML Workshop Graph Represent. Learn. Beyond (GRL)","author":"Morris"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58961-9_12"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10677500.pdf?arnumber=10677500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T05:43:43Z","timestamp":1727243023000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10677500\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3458050","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}