{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:30:29Z","timestamp":1743078629214,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030200800"},{"type":"electronic","value":"9783030200817"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-20081-7_3","type":"book-chapter","created":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T23:02:31Z","timestamp":1560121351000},"page":"25-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning the Graph Edit Costs: What Do We Want to Optimise?"],"prefix":"10.1007","author":[{"given":"Elena","family":"Rica","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susana","family":"\u00c1lvarez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"issue":"4","key":"3_CR1","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 Recognit. Lett. 1(4), 245\u2013253 (1983)","journal-title":"Pattern Recognit. Lett."},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 13(3), 353\u2013362 (1983)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"1","key":"3_CR3","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.: A survey of graph edit distance. Pattern Anal. Appl. 13(1), 113\u2013129 (2010)","journal-title":"Pattern Anal. Appl."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.patrec.2015.08.003","volume":"65","author":"F Serratosa","year":"2015","unstructured":"Serratosa, F., Cort\u00e9s, X.: Graph Edit Distance: moving from global to local structure to solve the graph-matching problem. Pattern Recognit. Lett. 65, 204\u2013210 (2015)","journal-title":"Pattern Recognit. Lett."},{"key":"3_CR5","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.: Graph edit distance: Restrictions to be a metric. Pattern Recognit. 90, 250\u2013256 (2019)","journal-title":"Pattern Recognit."},{"issue":"3","key":"3_CR6","first-page":"305","volume":"35","author":"M Neuhaus","year":"2005","unstructured":"Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. Trans. Syst. Man Cybern. 35(3), 305\u2013314 (2005)","journal-title":"Trans. Syst. Man Cybern."},{"issue":"1","key":"3_CR7","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)","journal-title":"Inf. Sci."},{"issue":"6","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"TS Caetano","year":"2009","unstructured":"Caetano, T.S., McAuley, J.J., Cheng, L., Le, Q.V., Smola, A.J.: Learning graph matching. Trans. Pattern Anal. Mach. Intell. 31(6), 1048\u20131058 (2009)","journal-title":"Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s11263-011-0442-2","volume":"96","author":"M Leordeanu","year":"2012","unstructured":"Leordeanu, M., Sukthankar, R., Hebert, M.: Unsupervised learning for graph matching. Int. J. Comput. Vis. 96(1), 28\u201345 (2012)","journal-title":"Int. J. Comput. Vis."},{"key":"3_CR10","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 Recognit. Lett. 56, 22\u201329 (2015)","journal-title":"Pattern Recognit. Lett."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Cort\u00e9s, X., Serratosa, F.: Learning graph matching substitution weights based on the ground truth node correspondence. Int. J. Pattern Recognit. Artif. Intell. 30(2), 1650005, 22 p. (2016)","DOI":"10.1142\/S0218001416500051"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-58961-9_5","volume-title":"Graph-Based Representations in Pattern Recognition","author":"R Raveaux","year":"2017","unstructured":"Raveaux, R., Martineau, M., Conte, D., Venturini, G.: Learning graph matching with a graph-based perceptron in a classification context. In: Foggia, P., Liu, C.-L., Vento, M. (eds.) GbRPR 2017. LNCS, vol. 10310, pp. 49\u201358. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58961-9_5"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-97785-0_31","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"X Cort\u00e9s","year":"2018","unstructured":"Cort\u00e9s, X., Conte, D., Cardot, H., Serratosa, F.: A deep neural network architecture to estimate node assignment costs for the graph edit distance. In: Bai, X., Hancock, E.R., Ho, T.K., Wilson, R.C., Biggio, B., Robles-Kelly, A. (eds.) S+SSPR 2018. LNCS, vol. 11004, pp. 326\u2013336. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-97785-0_31"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-319-97785-0_27","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"P Santacruz","year":"2018","unstructured":"Santacruz, P., Serratosa, F.: Learning the sub-optimal graph edit distance edit costs based on an embedded model. In: Bai, X., Hancock, E.R., Ho, T.K., Wilson, R.C., Biggio, B., Robles-Kelly, A. (eds.) S+SSPR 2018. LNCS, vol. 11004, pp. 282\u2013292. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-97785-0_27"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.patrec.2018.08.026","volume":"112","author":"S Algabli","year":"2018","unstructured":"Algabli, S., Serratosa, F.: Embedding the node-to-node mappings to learn the Graph edit distance parameters. Pattern Recognit. Lett. 112, 353\u2013360 (2018)","journal-title":"Pattern Recognit. Lett."},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Martineau, M., Raveaux, R., Conte, D., Venturini, G.: Learning error-correcting graph matching with a multiclass neural network. Pattern Recognit. Lett. (2018, in press). https:\/\/doi.org\/10.1016\/j.patrec.2018.03.031","DOI":"10.1016\/j.patrec.2018.03.031"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-540-88688-4_44","volume-title":"Computer Vision \u2013 ECCV 2008","author":"L Torresani","year":"2008","unstructured":"Torresani, L., Kolmogorov, V., Rother, C.: Feature correspondence via graph matching: models and global optimization. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008. LNCS, vol. 5303, pp. 596\u2013609. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88688-4_44"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Cho, M., Alahari, K., Ponce, J.: Learning graphs to match. In: ICCV 2013, pp: 25\u201332 (2013)","DOI":"10.1109\/ICCV.2013.11"},{"issue":"4","key":"3_CR19","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1016\/j.patcog.2014.10.033","volume":"48","author":"F Serratosa","year":"2015","unstructured":"Serratosa, F., Cort\u00e9s, X.: Interactive graph-matching using active query strategies. Pattern Recognit. 48(4), 1364\u20131373 (2015)","journal-title":"Pattern Recognit."},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","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.: An interactive method for the image alignment problem based on partially supervised correspondence. Expert Syst. Appl. 42(1), 179\u2013192 (2015)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","volume":"PAMI-1","author":"D Davies","year":"1979","unstructured":"Davies, D., Bouldin, D.: A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-1(2), 224\u2013227 (1979)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/01969727408546059","volume":"4","author":"J Dunn","year":"1974","unstructured":"Dunn, J.: Well-separated clusters and optimal fuzzy partitions. J. Cybern. 4, 95\u2013104 (1974)","journal-title":"J. Cybern."},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1111\/j.2044-8317.1976.tb00714.x","volume":"29","author":"L Hubert","year":"1976","unstructured":"Hubert, L., Schultz, J.: Quadratic assignment as a general data analysis strategy. Br. J. Math. Stat. Psychol. 29, 190\u2013241 (1976)","journal-title":"Br. J. Math. Stat. Psychol."},{"key":"3_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9995-0_1","volume-title":"Measures of Association for Cross Classification","author":"L Goodman","year":"1979","unstructured":"Goodman, L., Kruskal, W.: Measures of Association for Cross Classification. Springer, New York (1979). https:\/\/doi.org\/10.1007\/978-1-4612-9995-0_1"},{"issue":"1","key":"3_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/03610927408827101","volume":"3","author":"T Calinski","year":"1974","unstructured":"Calinski, T., Harabasz, J.: A dendrite method for cluster analysis. Commun. Stat.-Theory Methods 3(1), 1\u201327 (1974)","journal-title":"Commun. Stat.-Theory Methods"},{"issue":"336","key":"3_CR26","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"W Rand","year":"1971","unstructured":"Rand, W.: Objective criteria for the evaluation of clustering methods. J. A. Stat. Assoc. 66(336), 846\u2013850 (1971)","journal-title":"J. A. Stat. Assoc."},{"key":"3_CR27","volume-title":"Algorithms for Clustering Data","author":"A Jain","year":"1988","unstructured":"Jain, A., Dubes, R.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)"},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1080\/01621459.1983.10478008","volume":"78","author":"E Fowlkes","year":"1983","unstructured":"Fowlkes, E., Mallows, C.: A method for comparing two hierarchical clusterings. J. Am. Stat. Assoc. 78, 553\u2013584 (1983)","journal-title":"J. Am. Stat. Assoc."},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-319-49055-7_46","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"CF Moreno-Garc\u00eda","year":"2016","unstructured":"Moreno-Garc\u00eda, C.F., Cort\u00e9s, X., Serratosa, F.: A graph repository for learning error-tolerant graph matching. In: Robles-Kelly, A., Loog, M., Biggio, B., Escolano, F., Wilson, R. (eds.) Structural, Syntactic, and Statistical Pattern Recognition, vol. 10029, pp. 519\u2013529. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49055-7_46"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20081-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:32:50Z","timestamp":1709818370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-20081-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030200800","9783030200817"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20081-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GbRPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Based Representations in Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tours","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gbrpr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gbr2019.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}