{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:58:37Z","timestamp":1760597917840,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T00:00:00Z","timestamp":1569801600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T00:00:00Z","timestamp":1569801600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s11063-019-10121-w","type":"journal-article","created":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T01:35:45Z","timestamp":1569893745000},"page":"881-904","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Learning the Graph Edit Costs Based on a Learning Model Applied to Sub-optimal Graph Matching"],"prefix":"10.1007","volume":"51","author":[{"given":"Pep","family":"Santacruz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6112-5913","authenticated-orcid":false,"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,30]]},"reference":[{"key":"10121_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.patrec.2016.10.004","volume":"84","author":"Z Abu-Aisheh","year":"2016","unstructured":"Abu-Aisheh Z, Raveaux R, Ramel J (2016) Anytime graph matching. Pattern Recognit Lett 84:215\u2013224","journal-title":"Pattern Recognit Lett"},{"key":"10121_CR2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.patrec.2018.08.026","volume":"112","author":"S Algabli","year":"2018","unstructured":"Algabli S, Serratosa F (2018) Embedding the node-to-node mappings to learn the graph edit distance parameters. Pattern Recognit Lett 112:353\u2013360","journal-title":"Pattern Recognit Lett"},{"issue":"11","key":"10121_CR3","doi-asserted-by":"publisher","first-page":"5441","DOI":"10.1109\/TNNLS.2018.2803523","volume":"29","author":"M Bongini","year":"2018","unstructured":"Bongini M, Rigutini L, Trentin E (2018) Recursive neural networks for density estimation over generalized random graphs. IEEE Trans Neural Netw Learn Syst 29(11):5441\u20135458. \nhttps:\/\/doi.org\/10.1109\/TNNLS.2018.2803523","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"10121_CR4","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.patrec.2016.10.001","volume":"87","author":"S Bougleux","year":"2017","unstructured":"Bougleux S, Brun L, Carletti V, Foggia P, Ga\u00fcz\u00e8re B, Vento M (2017) Graph edit distance as a quadratic assignment problem. Pattern Recognit Lett 87:38\u201346","journal-title":"Pattern Recognit Lett"},{"issue":"4","key":"10121_CR5","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 (1983) Inexact graph matching for structural pattern recognition. Pattern Recognit Lett 1(4):245\u2013253. \nhttps:\/\/doi.org\/10.1016\/0167-8655(83)90033-8","journal-title":"Pattern Recognit Lett"},{"issue":"4","key":"10121_CR6","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TPAMI.2004.1265866","volume":"26","author":"T Caelli","year":"2004","unstructured":"Caelli T, Kosinov S (2004) An eigenspace projection clustering method for inexact graph matching. IEEE Trans Pattern Anal Mach Intell 26(4):515\u2013519","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"6","key":"10121_CR7","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"TS Caetano","year":"2009","unstructured":"Caetano TS, McAuley JJ, Cheng L, Le QV, Smola AJ (2009) Learning graph matching. IEEE Trans Pattern Anal Mach Intell 31(6):1048\u20131058","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"03","key":"10121_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte D, Foggia P, Sansone C, Vento M (2004) Thirty years of graph matching in pattern recognition. Int J Pattern Recognit Artif Intell 18(03):265\u2013298","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"1","key":"10121_CR9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.eswa.2014.07.051","volume":"42","author":"X Cort\u00e9s","year":"2015","unstructured":"Cort\u00e9s X, Serratosa F (2015) An interactive method for the image alignment problem based on partially supervised correspondence. Expert Syst Appl 42(1):179\u2013192","journal-title":"Expert Syst Appl"},{"key":"10121_CR10","doi-asserted-by":"crossref","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 (2015) Learning graph-matching edit-costs based on the optimality of the oracle\u2019s node correspondences. Pattern Recognit Lett 56:22\u201329","journal-title":"Pattern Recognit Lett"},{"key":"10121_CR11","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.eswa.2015.09.049","volume":"45","author":"X Cort\u00e9s","year":"2016","unstructured":"Cort\u00e9s X, Serratosa F (2016) Cooperative pose estimation of a fleet of robots based on interactive points alignment. Expert Syst Appl 45:150\u2013160","journal-title":"Expert Syst Appl"},{"issue":"02","key":"10121_CR12","doi-asserted-by":"crossref","first-page":"1650005","DOI":"10.1142\/S0218001416500051","volume":"30","author":"X Cort\u00e9s","year":"2016","unstructured":"Cort\u00e9s X, Serratosa F (2016) Learning graph matching substitution weights based on the ground truth node correspondence. Int J Pattern Recognit Artif Intell 30(02):1650005","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"10121_CR13","doi-asserted-by":"crossref","unstructured":"Cort\u00e9s X, Serratosa F, Riesen K (2016) On the relevance of local neighbourhoods for greedy graph edit distance. In: S+SSPR, lecture notes in computer science, vol 10029, pp 121\u2013131","DOI":"10.1007\/978-3-319-49055-7_11"},{"key":"10121_CR14","unstructured":"Defferrard M, Bresson X, Vandergheynst P (2016) Convolutional neural networks on graphs with fast localized spectral filtering. In: NIPS, pp 3837\u20133845"},{"key":"10121_CR15","unstructured":"Duin RPW, Pekalska E (2011) The dissimilarity representation for structural pattern recognition. In: CIARP, lecture notes in computer science, vol 7042. Springer, pp 1\u201324"},{"issue":"1","key":"10121_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/01969727408546059","volume":"4","author":"JC Dunn","year":"1974","unstructured":"Dunn JC (1974) Well-separated clusters and optimal fuzzy partitions. J Cybern 4(1):95\u2013104. \nhttps:\/\/doi.org\/10.1080\/01969727408546059","journal-title":"J Cybern"},{"key":"10121_CR17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.patrec.2015.07.010","volume":"65","author":"M Ferrer","year":"2015","unstructured":"Ferrer M, Serratosa F, Riesen K (2015) Improving bipartite graph matching by assessing the assignment confidence. Pattern Recognit Lett 65:29\u201336","journal-title":"Pattern Recognit Lett"},{"issue":"01","key":"10121_CR18","doi-asserted-by":"crossref","first-page":"1450001","DOI":"10.1142\/S0218001414500013","volume":"28","author":"P Foggia","year":"2014","unstructured":"Foggia P, Percannella G, Vento M (2014) Graph matching and learning in pattern recognition in the last 10 years. Int J Pattern Recognit Artif Intell 28(01):1450001","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"1","key":"10121_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao X, Xiao B, Tao D, Li X (2010) A survey of graph edit distance. Pattern Anal Appl 13(1):113\u2013129. \nhttps:\/\/doi.org\/10.1007\/s10044-008-0141-y","journal-title":"Pattern Anal Appl"},{"key":"10121_CR20","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"MR Garey","year":"1990","unstructured":"Garey MR, Johnson DS (1990) Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman & Co., New York"},{"issue":"9","key":"10121_CR21","doi-asserted-by":"crossref","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 (2012) Graph embedding in vector spaces by node attribute statistics. Pattern Recognit 45(9):3072\u20133083","journal-title":"Pattern Recognit"},{"issue":"4","key":"10121_CR22","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S Gold","year":"1996","unstructured":"Gold S, Rangarajan A (1996) A graduated assignment algorithm for graph matching. IEEE Trans Pattern Anal Mach Intell 18(4):377\u2013388. \nhttps:\/\/doi.org\/10.1109\/34.491619","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"10121_CR23","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100\u2013107. \nhttps:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE Trans Syst Sci Cybern"},{"issue":"1","key":"10121_CR24","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/s11263-011-0442-2","volume":"96","author":"M Leordeanu","year":"2012","unstructured":"Leordeanu M, Sukthankar R, Hebert M (2012) Unsupervised learning for graph matching. Int J Comput Vis 96(1):28\u201345","journal-title":"Int J Comput Vis"},{"issue":"3","key":"10121_CR25","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10044-012-0284-8","volume":"16","author":"L Livi","year":"2013","unstructured":"Livi L, Rizzi A (2013) The graph matching problem. Pattern Anal Appl 16(3):253\u2013283","journal-title":"Pattern Anal Appl"},{"issue":"2","key":"10121_CR26","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/j.patcog.2012.07.029","volume":"46","author":"MM Luqman","year":"2013","unstructured":"Luqman MM, Ramel JY, Llad\u00f3s J, Brouard T (2013) Fuzzy multilevel graph embedding. Pattern Recognit 46(2):551\u2013565. \nhttps:\/\/doi.org\/10.1016\/j.patcog.2012.07.029","journal-title":"Pattern Recognit"},{"key":"10121_CR27","doi-asserted-by":"crossref","unstructured":"Moreno-Garc\u00eda Carlos\u00a0Francisco CX, Serratosa F (2016) A graph repository for learning error-tolerant graph matching. In: Syntactic and structural pattern recognition","DOI":"10.1007\/978-3-319-49055-7_46"},{"issue":"6","key":"10121_CR28","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/34.862201","volume":"22","author":"R Myers","year":"2000","unstructured":"Myers R, Wilson RC, Hancock ER (2000) Bayesian graph edit distance. IEEE Trans Pattern Anal Mach Intell 22(6):628\u2013635. \nhttps:\/\/doi.org\/10.1109\/34.862201","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"10121_CR29","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TSMCB.2005.846635","volume":"35","author":"M Neuhaus","year":"2005","unstructured":"Neuhaus M, Bunke H (2005) Self-organizing maps for learning the edit costs in graph matching. IEEE Trans Syst Man Cybern Part B (Cybern) 35(3):503\u2013514","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"issue":"1","key":"10121_CR30","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.ins.2006.02.013","volume":"177","author":"M Neuhaus","year":"2007","unstructured":"Neuhaus M, Bunke H (2007) Automatic learning of cost functions for graph edit distance. Inf Sci 177(1):239\u2013247","journal-title":"Inf Sci"},{"key":"10121_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-27252-8","volume-title":"Structural pattern recognition with graph edit distance. Advances in computer vision and pattern recognition","author":"K Riesen","year":"2015","unstructured":"Riesen K (2015) Structural pattern recognition with graph edit distance. Advances in computer vision and pattern recognition. Springer, Cham"},{"issue":"7","key":"10121_CR32","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen K, Bunke H (2009) Approximate graph edit distance computation by means of bipartite graph matching. Image Vis Comput 27(7):950\u2013959","journal-title":"Image Vis Comput"},{"key":"10121_CR33","doi-asserted-by":"publisher","unstructured":"Riesen K, Ferrer M, Dornberger R, Bunke H (2015) Greedy graph edit distance. In: Proceedings of the 11th international conference on machine learning and data mining in pattern recognition\u2014vol 9166, MLDM 2015. Springer, Berlin, pp 3\u201316. \nhttps:\/\/doi.org\/10.1007\/978-3-319-21024-7_1","DOI":"10.1007\/978-3-319-21024-7_1"},{"issue":"2","key":"10121_CR34","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s11063-017-9739-7","volume":"48","author":"K Riesen","year":"2018","unstructured":"Riesen K, Fischer A, Bunke H (2018) On the impact of using utilities rather than costs for graph matching. Neural Process Lett 48(2):691\u2013707. \nhttps:\/\/doi.org\/10.1007\/s11063-017-9739-7","journal-title":"Neural Process Lett"},{"key":"10121_CR35","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/S0031-3203(01)00066-8","volume":"35","author":"A Sanfeliu","year":"2002","unstructured":"Sanfeliu A, Alqu\u00e9zar R, Andrade J, Climent J, Serratosa F, Verg\u00e9s-Llah\u00ed J (2002) Graph-based representations and techniques for image processing and image analysis. Pattern Recognit 35:639\u2013650","journal-title":"Pattern Recognit"},{"key":"10121_CR36","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu A, Fu KS (1983) A distance measure between attributed relational graphs for pattern recognition. IEEE Trans Syst Man Cybern. \nhttps:\/\/doi.org\/10.1109\/TSMC.1983.6313167","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"10121_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.04.003","author":"P Santacruz","year":"2018","unstructured":"Santacruz P, Serratosa F (2018) Error-tolerant graph matching in linear computational cost using an initial small partial matching. Pattern Recognit Lett. \nhttps:\/\/doi.org\/10.1016\/j.patrec.2018.04.003","journal-title":"Pattern Recognit Lett"},{"key":"10121_CR38","doi-asserted-by":"crossref","unstructured":"Santacruz P, Serratosa F (2018) Learning the sub-optimal graph edit distance edit costs based on an embedded model. In: S+SSPR, lecture notes in computer science, vol 11004. Springer, pp 282\u2013292","DOI":"10.1007\/978-3-319-97785-0_27"},{"key":"10121_CR39","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.patrec.2014.04.015","volume":"45","author":"F Serratosa","year":"2014","unstructured":"Serratosa F (2014) Fast computation of bipartite graph matching. Pattern Recognit Lett 45:244\u2013250","journal-title":"Pattern Recognit Lett"},{"key":"10121_CR40","doi-asserted-by":"publisher","first-page":"1550010","DOI":"10.1142\/S021800141550010X","volume":"29","author":"F Serratosa","year":"2014","unstructured":"Serratosa F (2014) Speeding up fast bipartite graph matching through a new cost matrix. Int J Pattern Recognit Artif Intell 29:1550010. \nhttps:\/\/doi.org\/10.1142\/S021800141550010X","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"10121_CR41","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.imavis.2015.06.005","volume":"40","author":"F Serratosa","year":"2015","unstructured":"Serratosa F (2015) Computation of graph edit distance: reasoning about optimality and speed-up. Image Vis Comput 40:38\u201348","journal-title":"Image Vis Comput"},{"key":"10121_CR42","unstructured":"Serratosa F (2015) Graph databases. \nhttp:\/\/deim.urv.cat\/~francesc.serratosa\/databases\/"},{"issue":"11","key":"10121_CR43","first-page":"1850038","volume":"32","author":"F Serratosa","year":"2018","unstructured":"Serratosa F (2018) A methodology to generate attributed graphs with a bounded graph edit distance for graph-matching testing. IJPRAI 32(11):1850038","journal-title":"IJPRAI"},{"key":"10121_CR44","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.patcog.2019.01.043","volume":"90","author":"F Serratosa","year":"2019","unstructured":"Serratosa F (2019) Graph edit distance: restrictions to be a metric. Pattern Recognit 90:250\u2013256. \nhttps:\/\/doi.org\/10.1016\/j.patcog.2019.01.043","journal-title":"Pattern Recognit"},{"key":"10121_CR45","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.patrec.2015.08.003","volume":"65","author":"F Serratosa","year":"2015","unstructured":"Serratosa F, Cort\u00e9s X (2015) Graph edit distance: moving from global to local structure to solve the graph-matching problem. Pattern Recognit Lett 65:204\u2013210","journal-title":"Pattern Recognit Lett"},{"issue":"5","key":"10121_CR46","first-page":"1260004","volume":"26","author":"A Sol\u00e9-Ribalta","year":"2012","unstructured":"Sol\u00e9-Ribalta A, Serratosa F, Sanfeliu A (2012) On the graph edit distance cost: properties and applications. IJPRAI 26(5):1260004","journal-title":"IJPRAI"},{"key":"10121_CR47","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.neucom.2018.05.095","volume":"313","author":"E Trentin","year":"2018","unstructured":"Trentin E, Di Iorio E (2018) Nonparametric small random networks for graph-structured pattern recognition. Neurocomputing 313:14\u201324. \nhttps:\/\/doi.org\/10.1016\/j.neucom.2018.05.095","journal-title":"Neurocomputing"},{"issue":"2","key":"10121_CR48","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.patcog.2014.01.002","volume":"48","author":"M Vento","year":"2015","unstructured":"Vento M (2015) A long trip in the charming world of graphs for pattern recognition. Pattern Recognit 48(2):291\u2013301","journal-title":"Pattern Recognit"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-019-10121-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11063-019-10121-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-019-10121-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T23:43:58Z","timestamp":1601336638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11063-019-10121-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,30]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["10121"],"URL":"https:\/\/doi.org\/10.1007\/s11063-019-10121-w","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"type":"print","value":"1370-4621"},{"type":"electronic","value":"1573-773X"}],"subject":[],"published":{"date-parts":[[2019,9,30]]},"assertion":[{"value":"30 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}