{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:50:16Z","timestamp":1742975416110,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208430"},{"type":"electronic","value":"9783642208447"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20844-7_17","type":"book-chapter","created":{"date-parts":[[2011,5,4]],"date-time":"2011-05-04T09:48:38Z","timestamp":1304502518000},"page":"164-174","source":"Crossref","is-referenced-by-count":3,"title":["Exploration of the Labelling Space Given Graph Edit Distance Costs"],"prefix":"10.1007","author":[{"given":"Albert","family":"Sol\u00e9-Ribalta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","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.: A Distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics\u00a013(3), 353\u2013362 (1983)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"3-4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H. Bunke","year":"1998","unstructured":"Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters\u00a019(3-4), 255\u2013259 (1998)","journal-title":"Pattern Recognition Letters"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/TPAMI.1985.4767621","volume":"7","author":"L. Shapiro","year":"1985","unstructured":"Shapiro, L., Haralick, R.M.: A metric for comparing relational descriptions. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a07, 90\u201394 (1985)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"7","key":"17_CR4","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 Vision Comput.\u00a027(7), 950\u2013959 (2009)","journal-title":"Image Vision Comput."},{"doi-asserted-by":"crossref","unstructured":"Neuhaus, M., Bunke, H.: Bridging the Gap Between Graph Edit Distance and Kernel Machines. Ser. in Machine Perception and Art. Intelligence, ISBN 9812708170 (2007)","key":"17_CR5","DOI":"10.1142\/6523"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-45028-9_12","volume-title":"Graph Based Representations in Pattern Recognition","author":"D. Conte","year":"2003","unstructured":"Conte, D., Guidobaldi, C., Sansone, C.: A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs. In: Hancock, E., Vento, M. (eds.) GbRPR 2003. LNCS, vol.\u00a02726, pp. 130\u2013141. Springer, Heidelberg (2003)"},{"issue":"1","key":"17_CR7","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 Analysis & Applications\u00a013(1), 113\u2013129 (2010)","journal-title":"Pattern Analysis & Applications"},{"issue":"1","key":"17_CR8","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 costs functions for graph edit distance. Information Sciences\u00a0177(1), 239\u2013247 (2007)","journal-title":"Information Sciences"},{"issue":"5","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1016\/j.patcog.2009.11.019","volume":"43","author":"A.H. Toselli","year":"2010","unstructured":"Toselli, A.H., Romero, V., Pastor, M., Vidal, E.: Multimodal interactive transcription of text images. Pattern Recognition\u00a043(5), 1814\u20131825 (2010)","journal-title":"Pattern Recognition"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/978-3-642-20844-7_16","volume-title":"GbRPR 2011","author":"F. Serratosa","year":"2011","unstructured":"Serratosa, F., Sol\u00e9-Ribalta, A., Cort\u00e9s, X.: Automatic Learning of Edit Costs based on Interactive & Adaptive Graph Recognition. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol.\u00a06658, pp. 152\u2013163. Springer, Heidelberg (2011)"},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a018(4), 377\u2013388 (1996)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TPAMI.1985.4767707","volume":"7","author":"A.K.C. Wong","year":"1985","unstructured":"Wong, A.K.C., et al.: Entropy and distance of random graphs with application to structural pattern recognition. IEEE T. on Pat. An. and Mach. Intell.\u00a07, 599\u2013609 (1985)","journal-title":"IEEE T. on Pat. An. and Mach. Intell."},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02526038","volume":"18","author":"S.V. Rice","year":"1997","unstructured":"Rice, S.V., Bunke, H., Nartker, T.A.: Classes of cost functions for string edit distance. Algorithmica\u00a018(2), 271\u2013280 (1997)","journal-title":"Algorithmica"},{"issue":"9","key":"17_CR14","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1109\/34.790431","volume":"21","author":"H. Bunke","year":"1999","unstructured":"Bunke, H.: Error Correcting Graph Matching: On the Influence of the Underlying Cost Function. IEEE TPAMI\u00a021(9), 917\u2013922 (1999)","journal-title":"IEEE TPAMI"},{"doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes, 2nd edn. ISBN 0387404090 (2003)","key":"17_CR15","DOI":"10.1007\/978-1-4613-0019-9_3"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"K. Riesen","year":"2008","unstructured":"Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) S+SSPR 2008. LNCS, vol.\u00a05342, pp. 287\u2013297. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20844-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T02:18:26Z","timestamp":1558577906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20844-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208430","9783642208447"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20844-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}