{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:24:58Z","timestamp":1759134298790,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319589602"},{"type":"electronic","value":"9783319589619"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58961-9_21","type":"book-chapter","created":{"date-parts":[[2017,5,9]],"date-time":"2017-05-09T03:53:18Z","timestamp":1494301998000},"page":"232-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Edit Distance Between Graph Correspondences"],"prefix":"10.1007","author":[{"given":"Carlos Francisco","family":"Moreno-Garc\u00eda","sequence":"first","affiliation":[]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[]},{"given":"Xiaoyi","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,10]]},"reference":[{"issue":"3","key":"21_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. Int. J. Pattern Recognit. Artif. Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"issue":"1","key":"21_CR2","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 on the last ten years. Int. J. Pattern Recognit. Artif. Intell. 28(1), 1450001 (2014). (40 pages)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.patcog.2014.01.002","volume":"48","author":"M Vento","year":"2015","unstructured":"Vento, M.: A long trip in the charming world of graphs for pattern recognition. Pattern Recognit. 48(2), 291\u2013301 (2015)","journal-title":"Pattern Recognit."},{"issue":"6","key":"21_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."},{"issue":"9","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1109\/TPAMI.2015.2501802","volume":"38","author":"F Zhou","year":"2016","unstructured":"Zhou, F., De la Torre, F.: Factorized graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 38(9), 1774\u20131789 (2016)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"21_CR6","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). doi:10.1007\/978-3-319-49055-7_46"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"issue":"9","key":"21_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theoret. Comput. Sci. 337(9), 217\u2013239 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"21_CR9","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":"21_CR10","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."},{"issue":"5","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1260004","DOI":"10.1142\/S021800141260004X","volume":"26","author":"A Sol\u00e9-Ribalta","year":"2012","unstructured":"Sol\u00e9-Ribalta, A., Serratosa, F., Sanfeliu, A.: On the graph edit distance cost: properties and applications. Int. J. Pattern Recognit Artif Intell. 26(5), 1260004 (2012). (24 pages)","journal-title":"Int. J. Pattern Recognit Artif Intell."},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-319-18224-7_23","volume-title":"Graph-Based Representations in Pattern Recognition","author":"X Cort\u00e9s","year":"2015","unstructured":"Cort\u00e9s, X., Serratosa, F., Moreno-Garc\u00eda, C.F.: On the influence of node centralities on graph edit distance for graph classification. In: Liu, C.-L., Luo, B., Kropatsch, W.G., Cheng, J. (eds.) GbRPR 2015. LNCS, vol. 9069, pp. 231\u2013241. Springer, Cham (2015). doi:10.1007\/978-3-319-18224-7_23"},{"key":"21_CR13","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":"21_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). doi:10.1007\/978-3-319-49055-7_11"},{"issue":"7","key":"21_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(7), 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"key":"21_CR16","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."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.imavis.2015.06.005","volume":"40","author":"F Serratosa","year":"2015","unstructured":"Serratosa, F.: Computation of graph edit distance: reasoning about optimality and speed-up. Image Vis. Comput. 40, 38\u201348 (2015)","journal-title":"Image Vis. Comput."},{"issue":"2","key":"21_CR18","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 trough a new cost matrix. Int. J. Pattern Recognit. Artif. Intell. 29(2), 1550010 (2015). (17 pages)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"e0145846","DOI":"10.1371\/journal.pone.0145846","volume":"11","author":"G Sanroma","year":"2016","unstructured":"Sanroma, G., Penate-Sanchez, A., Alquezar, R., Serratosa, F., Moreno-Noguer, F., Andrade-Cetto, J., Gonzalez, M.A.: MSClique: multiple structure discovery through the maximum weighted clique problem. PLoS ONE 11(1), e0145846 (2016)","journal-title":"PLoS ONE"},{"issue":"1","key":"21_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s100440200003","volume":"5","author":"H Bunke","year":"2002","unstructured":"Bunke, H., Jiang, X., Abegglen, K., Kandel, A.: On the weighted mean of a pair of strings. Pattern Anal. Appl. 5(1), 23\u201330 (2002)","journal-title":"Pattern Anal. Appl."},{"issue":"3","key":"21_CR21","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s006070170006","volume":"67","author":"H Bunke","year":"2001","unstructured":"Bunke, H., G\u00fcnter, S.: Weighted mean of a pair of graphs. Computing 67(3), 209\u2013224 (2001)","journal-title":"Computing"},{"issue":"1","key":"21_CR22","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10044-012-0304-8","volume":"17","author":"L Franek","year":"2014","unstructured":"Franek, L., Jiang, X., He, C.: Weighted mean of a pair of clusterings. Pattern Anal. Appl. 17(1), 153\u2013166 (2014)","journal-title":"Pattern Anal. Appl."},{"issue":"10","key":"21_CR23","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1109\/34.954604","volume":"23","author":"X Jiang","year":"2001","unstructured":"Jiang, X., M\u00fcnger, A., Bunke, H.: On median graphs: properties, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 23(10), 1144\u20131151 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"21_CR24","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10044-002-0184-4","volume":"6","author":"X Jiang","year":"2003","unstructured":"Jiang, X., Abegglen, K., Bunke, H., Csirik, J.: Dynamic computation of generalised median strings. Pattern Anal. Appl. 6(3), 185\u2013193 (2003)","journal-title":"Pattern Anal. Appl."},{"issue":"7","key":"21_CR25","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.patrec.2011.07.006","volume":"33","author":"X Jiang","year":"2012","unstructured":"Jiang, X., Wentker, J., Ferrer, M.: Generalized median string computation by means of string embedding in vector spaces. Pattern Recognit. Lett. 33(7), 842\u2013852 (2012)","journal-title":"Pattern Recognit. Lett."},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-34166-3_8","volume-title":"Structural, Syntactic and Statistical Pattern Recognition","author":"L Franek","year":"2012","unstructured":"Franek, L., Jiang, X.: Evolutionary weighted mean based framework for generalized median computation with application to strings. In: Gimel\u2019farb, G., et al. (eds.) S+SSPR 2012. LNCS, vol. 7626, pp. 70\u201378. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34166-3_8"},{"issue":"4","key":"21_CR27","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1016\/j.patcog.2009.10.013","volume":"43","author":"M Ferrer","year":"2010","unstructured":"Ferrer, M., Valveny, E., Serratosa, F., Riesen, K., Bunke, H.: Generalized median graph computation by means of graph embedding in vector spaces. Pattern Recognit. 43(4), 1642\u20131655 (2010)","journal-title":"Pattern Recognit."},{"issue":"2","key":"21_CR28","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.patcog.2013.08.019","volume":"47","author":"L Franek","year":"2014","unstructured":"Franek, L., Jiang, X.: Ensemble clustering by means of clustering embedding in vector spaces. Pattern Recognit. 47(2), 833\u2013842 (2014)","journal-title":"Pattern Recognit."},{"key":"21_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-319-49055-7_45","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"CF Moreno-Garc\u00eda","year":"2016","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F., Cort\u00e9s, X.: Generalised median of a set of correspondences based on the hamming distance. In: Robles-Kelly, A., Loog, M., Biggio, B., Escolano, F., Wilson, R. (eds.) S+SSPR 2016. LNCS, vol. 10029, pp. 507\u2013518. Springer, Cham (2016). doi:10.1007\/978-3-319-49055-7_45"},{"issue":"1","key":"21_CR30","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10044-015-0486-y","volume":"20","author":"CF Moreno-Garc\u00eda","year":"2015","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F.: Correspondence consensus of two sets of correspondences through optimisation functions. Pattern Anal. Appl. 20(1), 201\u2013213 (2015)","journal-title":"Pattern Anal. Appl."},{"key":"21_CR31","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.knosys.2015.09.034","volume":"90","author":"CF Moreno-Garc\u00eda","year":"2015","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F.: Online learning the consensus of multiple correspondences between sets. Knowl. Based Syst. 90, 49\u201357 (2015)","journal-title":"Knowl. Based Syst."},{"key":"21_CR32","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.cviu.2015.08.008","volume":"142","author":"CF Moreno-Garc\u00eda","year":"2016","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F.: Consensus of multiple correspondences between sets of elements. Comput. Vis. Image Underst. 142, 50\u201364 (2016)","journal-title":"Comput. Vis. Image Underst."},{"key":"21_CR33","doi-asserted-by":"crossref","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F.: Obtaining the consensus of multiple correspondences between graphs through online learning. Pattern Recognit. Lett. (2016)","DOI":"10.1016\/j.patrec.2016.09.003"},{"issue":"3","key":"21_CR34","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.cviu.2007.09.014","volume":"110","author":"H Bay","year":"2008","unstructured":"Bay, H., Ess, A., Tuytelaars, T., Van Gool, L.: Speeded-up robust features (SURF). Comput. Vis. Image Underst. 110(3), 346\u2013359 (2008)","journal-title":"Comput. Vis. Image Underst."}],"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-319-58961-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T16:30:39Z","timestamp":1712075439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-58961-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319589602","9783319589619"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58961-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"10 May 2017","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":"Anacapri","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gbrpr2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/gbr2017.unisa.it\/site\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}