{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T04:28:55Z","timestamp":1744172935326,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030739720"},{"type":"electronic","value":"9783030739737"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73973-7_23","type":"book-chapter","created":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T14:03:24Z","timestamp":1617977004000},"page":"238-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Metric Learning Approach to Graph Edit Costs for Regression"],"prefix":"10.1007","author":[{"given":"Linlin","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benoit","family":"Ga\u00fcz\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Yger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Honeine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,10]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.patrec.2017.10.007","volume":"100","author":"Z Abu-Aisheh","year":"2017","unstructured":"Abu-Aisheh, Z., et al.: Graph edit distance contest: results and future challenges. Pattern Recogn. Lett. 100, 96\u2013103 (2017)","journal-title":"Pattern Recogn. Lett."},{"issue":"3","key":"23_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/00031305.1992.10475879","volume":"46","author":"NS Altman","year":"1992","unstructured":"Altman, N.S.: An introduction to kernel and nearest-neighbor nonparametric regression. Am. Stat. 46(3), 175\u2013185 (1992)","journal-title":"Am. Stat."},{"key":"23_CR3","unstructured":"Balcilar, M., Renton, G., H\u00e9roux, P., Ga\u00fcz\u00e8re, B., Adam, S., Honeine, P.: When spectral domain meets spatial domain in graph neural networks. In: Proceedings of ICML 2020 - Workshop on Graph Representation Learning and Beyond (GRL+ 2020), Vienna, Austria, 12\u201318 July 2020"},{"issue":"1\u20132","key":"23_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10994-012-5293-8","volume":"89","author":"A Bellet","year":"2012","unstructured":"Bellet, A., Habrard, A., Sebban, M.: Good edit similarity learning by loss minimization. Mach. Learn. 89(1\u20132), 5\u201335 (2012)","journal-title":"Mach. Learn."},{"key":"23_CR5","unstructured":"Bellet, A., Habrard, A., Sebban, M.: A survey on metric learning for feature vectors and structured data. arXiv preprint arXiv:1306.6709 (2013)"},{"issue":"1","key":"23_CR6","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., Bougleux, S., Brun, L.: Comparing heuristics for graph edit distance computation. VLDB J. 29(1), 419\u2013458 (2020)","journal-title":"VLDB J."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Bougleux, S., Brun, L., Carletti, V., Foggia, P., Ga\u00fcz\u00e8re, B., Vento, M.: Graph edit distance as a quadratic assignment problem. Pattern Recogn. Lett. 87, 38\u201346 (2015)","DOI":"10.1016\/j.patrec.2016.10.001"},{"issue":"4","key":"23_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MSP.2017.2693418","volume":"34","author":"MM Bronstein","year":"2017","unstructured":"Bronstein, M.M., Bruna, J., LeCun, Y., Szlam, A., Vandergheynst, P.: Geometric deep learning: going beyond Euclidean data. IEEE Signal Process. Mag. 34(4), 18\u201342 (2017)","journal-title":"IEEE Signal Process. Mag."},{"issue":"9","key":"23_CR9","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1109\/34.790431","volume":"21","author":"H Bunke","year":"1999","unstructured":"Bunke, H.: Error correcting graph matching: on the influence of the underlying cost function. IEEE Trans. Pattern Anal. Mach. Intell. 21(9), 917\u2013922 (1999). https:\/\/doi.org\/10.1109\/34.790431","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"23_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H Bunke","year":"1983","unstructured":"Bunke, H., Allermann, G.: Inexact graph matching for structural pattern recognition. Pattern Recogn. Lett. 1(4), 245\u2013253 (1983)","journal-title":"Pattern Recogn. Lett."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1039\/ft9949000097","volume":"90","author":"D Cherqaoui","year":"1994","unstructured":"Cherqaoui, D., Villemin, D.: Use of a neural network to determine the boiling point of alkanes. J. Chem. Soc. Faraday Trans. 90, 97\u2013102 (1994)","journal-title":"J. Chem. Soc. Faraday Trans."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.1039\/ft9949002015","volume":"90","author":"D Cherqaoui","year":"1994","unstructured":"Cherqaoui, D., Villemin, D., Mesbah, A., Cense, J.M., Kvasnicka, V.: Use of a neural network to determine the normal boiling points of acyclic ethers, peroxides, acetals and their sulfur analogues. J. Chem. Soc. Faraday Trans. 90, 2015\u20132019 (1994)","journal-title":"J. Chem. Soc. Faraday Trans."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.patrec.2019.05.001","volume":"125","author":"X Cort\u00e9s","year":"2019","unstructured":"Cort\u00e9s, X., Conte, D., Cardot, H.: Learning edit cost estimation models for graph edit distance. Pattern Recogn. Lett. 125, 256\u2013263 (2019). https:\/\/doi.org\/10.1016\/j.patrec.2019.05.001","journal-title":"Pattern Recogn. Lett."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.patrec.2015.01.009","volume":"56","author":"X Cort\u00e9s","year":"2015","unstructured":"Cort\u00e9s, X., Serratosa, F.: Learning graph-matching edit-costs based on the optimality of the oracle\u2019s node correspondences. Pattern Recogn. Lett. 56, 22\u201329 (2015)","journal-title":"Pattern Recogn. Lett."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Cristianini, N., Shawe-Taylor, J., Elisseeff, A., Kandola, J.: On kernel-target alignment. In: Advances in Neural Information Processing Systems, pp. 367\u2013373 (2002)","DOI":"10.7551\/mitpress\/1120.003.0052"},{"issue":"1","key":"23_CR16","first-page":"2909","volume":"17","author":"S Diamond","year":"2016","unstructured":"Diamond, S., Boyd, S.: CVXPY: a python-embedded modeling language for convex optimization. J. Mach. Learn. Res. 17(1), 2909\u20132913 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"9","key":"23_CR17","doi-asserted-by":"publisher","first-page":"3072","DOI":"10.1016\/j.patcog.2012.01.009","volume":"45","author":"J Gibert","year":"2012","unstructured":"Gibert, J., Valveny, E., Bunke, H.: Graph embedding in vector spaces by node attribute statistics. Pattern Recogn. 45(9), 3072\u20133083 (2012)","journal-title":"Pattern Recogn."},{"issue":"2","key":"23_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/MSP.2010.939747","volume":"28","author":"P Honeine","year":"2011","unstructured":"Honeine, P., Richard, C.: Preimage problem in kernel-based machine learning. IEEE Signal Process. Mag. 28(2), 77\u201388 (2011)","journal-title":"IEEE Signal Process. Mag."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems. SIAM, Philadelphia (1995)","DOI":"10.1137\/1.9781611971217"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Neuhaus, M., Bunke, H.: A probabilistic approach to learning costs for graph edit distance. Proc. ICPR 3(C), 389\u2013393 (2004)","DOI":"10.1109\/ICPR.2004.1334548"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Trans. Syst. Man Cybern. 35(3), 503\u2013514 (2005)","DOI":"10.1109\/TSMCB.2005.846635"},{"issue":"1","key":"23_CR22","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ins.2006.02.013","volume":"177","author":"M Neuhaus","year":"2007","unstructured":"Neuhaus, M., Bunke, H.: Automatic learning of cost functions for graph edit distance. Inf. Sci. 177(1), 239\u2013247 (2007). https:\/\/doi.org\/10.1016\/j.ins.2006.02.013","journal-title":"Inf. Sci."},{"key":"23_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-020-09821-w","author":"S Onta\u00f1\u00f3n","year":"2020","unstructured":"Onta\u00f1\u00f3n, S.: An overview of distance and similarity functions for structured data. Artif. Intell. Rev. (2020). https:\/\/doi.org\/10.1007\/s10462-020-09821-w","journal-title":"Artif. Intell. Rev."},{"key":"23_CR24","series-title":"Advances in Computer Vision and Pattern Recognition","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27252-8","volume-title":"Structural Pattern Recognition with Graph Edit Distance","author":"K Riesen","year":"2015","unstructured":"Riesen, K.: Structural Pattern Recognition with Graph Edit Distance. ACVPR. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27252-8"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"K Riesen","year":"2008","unstructured":"Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., et al. (eds.) SSPR \/SPR 2008. LNCS, vol. 5342, pp. 287\u2013297. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89689-0_33"},{"key":"23_CR26","doi-asserted-by":"publisher","unstructured":"Ristad, E.S., N.yianilos, P.: Learning string-edit distance. IEEE Trans. Pattern Anal. Mach. Intell. 20(5), 522\u2013532 (1998). https:\/\/doi.org\/10.1109\/34.682181","DOI":"10.1109\/34.682181"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Sanfeliu, A., Fu, K.S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Systems, Man Cybern. 13(3), 353\u2013362 (1983)","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"23_CR28","unstructured":"Shervashidze, N., Schweitzer, P., Van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-lehman graph kernels. J. Mach. Learn. Res. 12(9) (2011)"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Virtanen, P., et al.: Scipy 1.0: fundamental algorithms for scientific computing in python. Nat. Method 17(3), 261\u2013272 (2020)","DOI":"10.1038\/s41592-019-0686-2"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73973-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T22:02:36Z","timestamp":1744149756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73973-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030739720","9783030739737"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73973-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"S+SSPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dais.unive.it\/sspr2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}