{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:19:03Z","timestamp":1759133943352,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319977843"},{"type":"electronic","value":"9783319977850"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-97785-0_31","type":"book-chapter","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T14:49:17Z","timestamp":1533134957000},"page":"326-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Deep Neural Network Architecture to Estimate Node Assignment Costs for the Graph Edit Distance"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Cort\u00e9s","sequence":"first","affiliation":[]},{"given":"Donatello","family":"Conte","sequence":"additional","affiliation":[]},{"given":"Hubert","family":"Cardot","sequence":"additional","affiliation":[]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,2]]},"reference":[{"issue":"3","key":"31_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 Recogn. Artif. Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"issue":"4","key":"31_CR2","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":"31_CR3","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 Recogn. Lett. 65, 204\u2013210 (2015)","journal-title":"Pattern Recogn. Lett."},{"issue":"6","key":"31_CR4","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. Pattern Anal. Mach. Intell. 31(6), 1048\u20131058 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Cort\u00e9s, X., Serratosa, F.: Learning graph matching substitution weights based on the ground truth node correspondence. IJPRAI 30(2) (2016)","DOI":"10.1142\/S0218001416500051"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.neunet.2014.09.003","volume":"61","author":"J Schmidhuber","year":"2015","unstructured":"Schmidhuber, J.: Deep learning in neural networks: an overview. Neural Netw. 61, 85\u2013117 (2015)","journal-title":"Neural Netw."},{"key":"31_CR7","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"},{"issue":"3","key":"31_CR8","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TSMCB.2005.846635","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. Syst. Man Cybern. Part B 35(3), 503\u2013514 (2005)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"issue":"1","key":"31_CR9","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":"1","key":"31_CR10","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":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-20844-7_16","volume-title":"Graph-Based Representations in Pattern Recognition","author":"F Serratosa","year":"2011","unstructured":"Serratosa, F., Sol\u00e9-Ribalta, A., Cort\u00e9s, X.: Automatic learning of edit costs based on interactive and adaptive graph recognition. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol. 6658, pp. 152\u2013163. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20844-7_16"},{"key":"31_CR12","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":"31_CR13","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.patrec.2015.10.007","volume":"69","author":"K Riesen","year":"2016","unstructured":"Riesen, K., Ferrer, M.: Predicting the correctness of node assignments in bipartite graph matching. Pattern Recogn. Lett. 69, 8\u201314 (2016)","journal-title":"Pattern Recogn. Lett."},{"issue":"2","key":"31_CR14","first-page":"375","volume":"172","author":"C Kanzow","year":"2004","unstructured":"Kanzow, C., Yamashita, N., Fukushima, M.: Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints. JCAM 172(2), 375\u2013397 (2004)","journal-title":"JCAM"},{"issue":"4","key":"31_CR15","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(4), 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Log. Q. 2, 83\u201397 (1955)","journal-title":"Naval Res. Log. Q."},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","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.) S+SSPR 2016. LNCS, 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","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97785-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:42:36Z","timestamp":1710348156000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-97785-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319977843","9783319977850"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97785-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 August 2018","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":"Beijing","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ssspr2018.buaa.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}