{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:13:34Z","timestamp":1743048814691,"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_4","type":"book-chapter","created":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T23:02:31Z","timestamp":1560121351000},"page":"35-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sub-optimal Graph Matching by Node-to-Node Assignment Classification"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Cort\u00e9s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donatello","family":"Conte","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":"03","key":"4_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognit. Artif. Intell. 18(03), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10044-012-0284-8","volume":"16","author":"L Livi","year":"2013","unstructured":"Livi, L., Rizzi, A.: The graph matching problem. Pattern Anal. Appl. 16(3), 253\u2013283 (2013)","journal-title":"Pattern Anal. Appl."},{"issue":"01","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1450001","DOI":"10.1142\/S0218001414500013","volume":"28","author":"P Foggia","year":"2014","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. J. Pattern Recognit. Artif. Intell. 28(01), 1450001 (2014)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"issue":"1","key":"4_CR4","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":"4_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."},{"key":"4_CR6","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":"4_CR7","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":"4_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.patrec.2016.06.014","volume":"87","author":"A Fischer","year":"2017","unstructured":"Fischer, A., Riesen, K., Bunke, H.: Improved quadratic time approximation of graph edit distance by combining hausdorff matching and greedy assignment. Pattern Recognit. Lett. 87, 55\u201362 (2017)","journal-title":"Pattern Recognit. Lett."},{"issue":"7","key":"4_CR9","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":"4","key":"4_CR10","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."},{"key":"4_CR11","doi-asserted-by":"publisher","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.: Improving bipartite graph matching by assessing the assignment confidence. Pattern Recognit. Lett. 65, 29\u201336 (2015)","journal-title":"Pattern Recognit. Lett."},{"issue":"02","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1550010","DOI":"10.1142\/S021800141550010X","volume":"29","author":"F Serratosa","year":"2015","unstructured":"Serratosa, F.: Speeding up fast bipartite graph matching through a new cost matrix. Int. J. Pattern Recognit. Artif. Intell. 29(02), 1550010 (2015)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32\u201338 (1957)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-49055-7_11","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"X Cort\u00e9s","year":"2016","unstructured":"Cort\u00e9s, X., Serratosa, F., Riesen, K.: On the relevance of local neighbourhoods for greedy graph edit distance. In: Robles-Kelly, A., Loog, M., Biggio, B., Escolano, F., Wilson, R. (eds.) S+SSPR 2016. LNCS, vol. 10029, pp. 121\u2013131. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49055-7_11"},{"key":"4_CR15","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":"4_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.patrec.2016.06.014","volume":"87","author":"A Fischer","year":"2017","unstructured":"Fischer, A., Riesen, K., Horst, B.: Improved quadratic time approximation of graph edit distance by combining Hausdorff matching and greedy assignment. Pattern Recognit. Lett. 87, 55\u201362 (2017)","journal-title":"Pattern Recognit. Lett."},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-21024-7_1","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"K Riesen","year":"2015","unstructured":"Riesen, K., Ferrer, M., Dornberger, R., Bunke, H.: Greedy graph edit distance. In: Perner, P. (ed.) MLDM 2015. LNCS (LNAI), vol. 9166, pp. 3\u201316. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21024-7_1"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.patrec.2014.04.015","volume":"45","author":"F Serratosa","year":"2014","unstructured":"Serratosa, F.: Fast computation of bipartite graph matching. Pattern Recognit. Lett. 45, 244\u2013250 (2014)","journal-title":"Pattern Recognit. Lett."},{"issue":"4","key":"4_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0167-6377(86)90073-8","volume":"5","author":"R Jonker","year":"1986","unstructured":"Jonker, R., Volgenant, T.: Improving the Hungarian assignment algorithm. Oper. Res. Lett. 5(4), 171\u2013175 (1986)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"4_CR20","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. IEEE Trans. PAMI 31(6), 1048\u20131058 (2009)","journal-title":"IEEE Trans. PAMI"},{"issue":"1","key":"4_CR21","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":"4_CR22","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."},{"issue":"02","key":"4_CR23","first-page":"1650005","volume":"30","author":"X Cort\u00e9s","year":"2016","unstructured":"Cort\u00e9s, X., Serratosa, F.: Learning graph matching substitution weights based on the ground truth node correspondence. IJPRAI 30(02), 1650005 (2016)","journal-title":"IJPRAI"},{"key":"4_CR24","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."},{"issue":"1","key":"4_CR25","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":"3","key":"4_CR26","first-page":"503","volume":"35","author":"M Neuhaus","year":"2005","unstructured":"Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Trans. SMC, Part B 35(3), 503\u2013514 (2005)","journal-title":"IEEE Trans. SMC, Part B"},{"issue":"1","key":"4_CR27","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/01969727408546059","volume":"4","author":"JC Dunn","year":"1974","unstructured":"Dunn, J.C.: Well-separated clusters and optimal fuzzy partitions. J. Cybern. 4(1), 95\u2013104 (1974)","journal-title":"J. Cybern."},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Moreno-Garc\u00eda, C.F., Cort\u00e9s, X., Serratosa, F.: A graph repository for learning error-tolerant graph matching. In: Proceedings of SSPR (2016)","DOI":"10.1007\/978-3-319-49055-7_46"},{"issue":"11","key":"4_CR29","first-page":"1850038","volume":"32","author":"F Serratosa","year":"2018","unstructured":"Serratosa, F.: A methodology to generate attributed graphs with a bounded graph edit distance for graph-matching testing. IJPRAI 32(11), 1850038 (2018)","journal-title":"IJPRAI"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:32:58Z","timestamp":1709818378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-20081-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030200800","9783030200817"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20081-7_4","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"}}]}}