{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T06:44:31Z","timestamp":1771915471072,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":33,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819500055","type":"print"},{"value":"9789819500062","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-95-0006-2_29","type":"book-chapter","created":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T07:34:27Z","timestamp":1753342467000},"page":"342-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unsupervised Learning for Solving the Graph Edit Distance"],"prefix":"10.1007","author":[{"given":"Jiahao","family":"Shan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,25]]},"reference":[{"issue":"4","key":"29_CR1","doi-asserted-by":"publisher","first-page":"1410","DOI":"10.1021\/acs.jcim.8b00820","volume":"59","author":"C Garcia-Hernandez","year":"2019","unstructured":"Garcia-Hernandez, C., Fernandez, A., Serratosa, F.: Ligand-based virtual screening using graph edit distance as molecular similarity measure. J. Chem. Inf. Model. 59(4), 1410\u20131421 (2019)","journal-title":"J. Chem. Inf. Model."},{"key":"29_CR2","unstructured":"Fey, M., Lenssen, J E., Morris, C., et al.: Deep Graph Matching Consensus. arXiv Preprint arXiv:2001.09621 (2020)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Yan, J., Yang, S., Hancock, E.R.: Learning for graph matching and related combinatorial optimization problems. In: International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, pp. 4988\u20134996 (2020)","DOI":"10.24963\/ijcai.2020\/694"},{"issue":"8","key":"29_CR4","doi-asserted-by":"publisher","first-page":"482","DOI":"10.14778\/2002974.2002976","volume":"4","author":"L Zou","year":"2011","unstructured":"Zou, L., Mo, J., Chen, L., et al.: GStore: answering SPARQL queries via subgraph matching. Proc. VLDB Endow. 4(8), 482\u2013493 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Bai, Y., Ding, H., Bian, S., et al.: Simgnn: a neural network approach to fast graph similarity computation. In: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, pp. 384\u2013392 (2019)","DOI":"10.1145\/3289600.3290967"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Chang, L., Feng, X., Lin, X., et al:. Speeding up GED verification for graph similarity search. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 793\u2013804. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00074"},{"key":"29_CR7","unstructured":"Li, Y., Gu, C., Dullien, T., et al.: Graph matching networks for learning the similarity of graph structured objects. In: International Conference on Machine Learning, pp. 3835\u20133845. PMLR (2019)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Cho, M., Alahari, K., Ponce, J.: Learning graphs to match. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 25\u201332 (2013)","DOI":"10.1109\/ICCV.2013.11"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/j.patrec.2019.06.024","volume":"125","author":"P Maergner","year":"2019","unstructured":"Maergner, P., Pondenkandath, V., Alberti, M., et al.: Combining graph edit distance and triplet networks for offline signature verification. Pattern Recogn. Lett. 125, 527\u2013533 (2019)","journal-title":"Pattern Recogn. Lett."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Chen, L., Lin, G., Wang, S., et al.: Graph edit distance reward: learning to edit scene graph. In: Computer Vision\u2013ECCV 2020: 16th European Conference, Glasgow, UK, 23\u201328 August 2020, Proceedings, Part XIX 16, pp. 539\u2013554. Springer (2020)","DOI":"10.1007\/978-3-030-58529-7_32"},{"issue":"1","key":"29_CR11","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s00778-019-00544-1","volume":"29","author":"DB Blumenthal","year":"2020","unstructured":"Blumenthal, D.B., Boria, N., Gamper, J., et al.: Comparing heuristics for graph edit distance computation. VLDB J. 29(1), 419\u2013458 (2020)","journal-title":"VLDB J."},{"issue":"5","key":"29_CR12","first-page":"4485","volume":"35","author":"L Chang","year":"2022","unstructured":"Chang, L., Feng, X., Yao, K., et al.: Accelerating graph similarity search via efficient GED computation. IEEE Trans. Knowl. Data Eng. 35(5), 4485\u20134498 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1016\/j.knosys.2018.10.002","volume":"163","author":"X Chen","year":"2019","unstructured":"Chen, X., Huo, H., Huan, J., et al.: An efficient algorithm for graph edit distance computation. Knowl.-Based Syst. 163, 762\u2013775 (2019)","journal-title":"Knowl.-Based Syst."},{"key":"29_CR14","unstructured":"Kim, J., Choi, D.H., Li, C.: Inves: incremental partitioning-based verification for graph similarity search. In: EDBT, pp. 229\u2013240 (2019)"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.patrec.2018.05.002","volume":"134","author":"DB Blumenthal","year":"2020","unstructured":"Blumenthal, D.B., Gamper, J.: On the exact computation of the graph edit distance. Pattern Recogn. Lett. 134, 46\u201357 (2020)","journal-title":"Pattern Recogn. Lett."},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Bai, J., Zhao, P.: Tagsim: type-aware graph similarity learning and computation. Proc. VLDB Endow. 15(2) (2021)","DOI":"10.14778\/3489496.3489513"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Bai, Y., Ding, H., Gu, K., et al.: Learning-based efficient graph similarity computation via multi-scale convolutional set matching. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 04, pp. 3219\u20133226 (2020)","DOI":"10.1609\/aaai.v34i04.5720"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Peng, Y., Choi, B., Xu, J.: Graph edit distance learning via modeling optimum matchings with constraints. In: IJCAI, pp. 1534\u20131540 (2021)","DOI":"10.24963\/ijcai.2021\/212"},{"key":"29_CR19","first-page":"22518","volume":"35","author":"R Ranjan","year":"2022","unstructured":"Ranjan, R., Grover, S., Medya, S., et al.: Greed: a neural framework for learning graph distance functions. Adv. Neural. Inf. Process. Syst. 35, 22518\u201322530 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Bu, J., Ester, M., et al.: H2mn: graph similarity learning with hierarchical hypergraph matching networks. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2274\u20132284 (2021)","DOI":"10.1145\/3447548.3467328"},{"key":"29_CR21","first-page":"30181","volume":"35","author":"W Zhuo","year":"2022","unstructured":"Zhuo, W., Tan, G.: Efficient graph similarity computation with alignment regularization. Adv. Neural. Inf. Process. Syst. 35, 30181\u201330193 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Wang, R., Zhang, T., Yu, T., et al.: Combinatorial learning of graph edit distance via dynamic embedding. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 5241\u20135250 (2021)","DOI":"10.1109\/CVPR46437.2021.00520"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Yang, L., Zou, L.: Noah: neural-optimized A* search algorithm for graph edit distance computation. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 576\u2013587. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00056"},{"key":"29_CR24","unstructured":"Riesen, K., Fankhauser, S., Bunke, H.: Speeding up graph edit distance computation with a bipartite heuristic. In: MLG, pp. 21\u201324 (2007)"},{"issue":"6","key":"29_CR25","doi-asserted-by":"publisher","first-page":"2985","DOI":"10.1109\/TAI.2023.3334261","volume":"5","author":"ZP Li","year":"2023","unstructured":"Li, Z.P., Su, H.L., Zhang, Q.H., et al.: Hierarchical multiview top-k pooling with deep-Q-networks. IEEE Trans. Artif. Intell. 5(6), 2985\u20132996 (2023)","journal-title":"IEEE Trans. Artif. Intell."},{"issue":"3","key":"29_CR26","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1109\/TCDS.2021.3100883","volume":"14","author":"ZP Li","year":"2021","unstructured":"Li, Z.P., Su, H.L., Zhu, X.B., et al.: Hierarchical graph pooling with self-adaptive cluster aggregation. IEEE Trans. Cogn. Dev. Syst. 14(3), 1198\u20131207 (2021)","journal-title":"IEEE Trans. Cogn. Dev. Syst."},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Neuhaus, M., Riesen, K., Bunke, H.: Fast suboptimal algorithms for the computation of graph edit distance. In: Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR), pp. 163\u2013172. Springer, Heidelberg (2006)","DOI":"10.1007\/11815921_17"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Fankhauser, S., Riesen, K., Bunke, H.: Speeding up graph edit distance computation through fast bipartite matching. In: Graph-Based Representations in Pattern Recognition: 8th IAPR-TC-15 International Workshop, GbRPR 2011, M\u00fcnster, Germany, 18\u201320 May 2011. Proceedings 8, pp. 102\u2013111. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-20844-7_11"},{"issue":"7","key":"29_CR29","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27(7), 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"issue":"1","key":"29_CR30","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14778\/1687627.1687631","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., et al.: Comparing stars: on approximating graph edit distance. Proc. VLDB Endow. 2(1), 25\u201336 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"29_CR31","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised Classification with Graph Convolutional Networks. arXiv Preprint arXiv:1609.02907 (2016)"},{"key":"29_CR32","unstructured":"Dai, X., Yan, X., Zhou, K., et al.: Edit Distance Embedding using Convolutional Neural Networks. arXiv Preprint arXiv:2001.11692 (2020)"},{"key":"29_CR33","doi-asserted-by":"crossref","unstructured":"Liu, J., Zhou, M., Ma, S., et al.: Mata*: combining learnable node matching with A* algorithm for approximate graph edit distance computation. In: Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, pp. 1503\u20131512 (2023)","DOI":"10.1145\/3583780.3614959"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0006-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T02:58:25Z","timestamp":1771901905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0006-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819500055","9789819500062"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0006-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"25 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ningbo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/icg\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}