{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T10:44:22Z","timestamp":1776163462297,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540749578","type":"print"},{"value":"9783540749585","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74958-5_9","type":"book-chapter","created":{"date-parts":[[2007,9,7]],"date-time":"2007-09-07T16:33:00Z","timestamp":1189182780000},"page":"54-66","source":"Crossref","is-referenced-by-count":7,"title":["Learning Metrics Between Tree Structured Data: Application to Image Recognition"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Boyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amaury","family":"Habrard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Sebban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"21th Int. Conf. (ICML 2004)","author":"M. Bilenko","year":"2004","unstructured":"Bilenko, M., Basu, S., Mooney, R.J.: Integrating constraints and metric learning in semi-supervised clustering. In: 21th Int. Conf (ICML 2004), ACM Press, New York (2004)"},{"key":"9_CR2","volume-title":"Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems], NIPS 2003","author":"M. Schultz","year":"2003","unstructured":"Schultz, M., Joachims, T.: Learning a distance metric from relative comparisons. In: Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems], NIPS 2003, MIT Press, Cambridge (2003)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1109\/ICDM.2005.107","volume-title":"Proc. of the 5th IEEE Int. Conf. on Data Mining (ICDM 2005)","author":"K. Kummamuru","year":"2005","unstructured":"Kummamuru, K., Krishnapuram, R., Agrawal, R.: On learning asymmetric dissimilarity measures. In: Proc. of the 5th IEEE Int. Conf. on Data Mining (ICDM 2005), pp. 697\u2013700. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"9_CR4","unstructured":"Bayoudh, S., Miclet, L., Delhay, A.: Learning by analogy: A classification rule for binary and nominal data. In: IJCAI, pp. 678\u2013683 (2007)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Wagner, R., Fisher, M.: The string to string correction problem. Journal of the ACM\u00a0 (1974)","DOI":"10.1145\/321796.321811"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Oncina, J., Sebban, M.: Learning stochastic edit distance: application in handwritten character recognition. Journal of Pattern Recognition (2006)","DOI":"10.1016\/j.patcog.2006.03.011"},{"issue":"5","key":"9_CR7","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/34.682181","volume":"20","author":"S. Ristad","year":"1998","unstructured":"Ristad, S., Yianilos, P.: Learning string-edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a020(5), 522\u2013532 (1998)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"9_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/11871842_9","volume-title":"Machine Learning: ECML 2006","author":"M. Bernard","year":"2006","unstructured":"Bernard, M., Habrard, A., Sebban, M.: Learning stochastic tree edit distance. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 42\u201353. Springer, Heidelberg (2006)"},{"issue":"6","key":"9_CR9","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","volume":"6","author":"S. Selkow","year":"1977","unstructured":"Selkow, S.: The tree-to-tree editing problem. Information Processing Letters\u00a06(6), 184\u2013186 (1977)","journal-title":"Information Processing Letters"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing, 1245\u20131262 (1989)","DOI":"10.1137\/0218082"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-45028-9_19","volume-title":"Graph Based Representations in Pattern Recognition","author":"J. Jolion","year":"2003","unstructured":"Jolion, J.: Some experiments on clustering a set of strings. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol.\u00a02726, pp. 214\u2013224. Springer, Heidelberg (2003)"},{"key":"9_CR12","first-page":"91","volume-title":"Proc. of the 6th European Symposium on Algorithms (ESA)","author":"P. Klein","year":"1998","unstructured":"Klein, P.: Computing the edit-distance between unrooted ordered trees. In: Proc. of the 6th European Symposium on Algorithms (ESA), pp. 91\u2013102. Springer, Heidelberg (1998)"},{"issue":"1-3","key":"9_CR13","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 problem. Theoretical Computer Science\u00a0337(1-3), 217\u2013239 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"39","key":"9_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"B","author":"A. Dempster","year":"1977","unstructured":"Dempster, A., Laird, M., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc\u00a0B(39), 1\u201338 (1977)","journal-title":"J. R. Stat. Soc"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Pentland, A., Picard, R., Sclaroff, S.: Photobook: Tools for content-based manipulation of image databases. In: SPIE Storage and Retrieval of Image and Video Databases, vol.\u00a02, pp. 18\u201332 (1995)","DOI":"10.1117\/12.171786"},{"issue":"9","key":"9_CR16","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1109\/34.955109","volume":"23","author":"J. Wang","year":"2001","unstructured":"Wang, J., Li, J., Wiederhold, G.: Simplicity: Semantics-sensitive integrated matching for picture libraries. IEEE Trans. on Pat. Ana. Mach. Int.\u00a023(9), 947\u2013963 (2001)","journal-title":"IEEE Trans. on Pat. Ana. Mach. Int."},{"issue":"8","key":"9_CR17","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TPAMI.2002.1023800","volume":"24","author":"C. Carson","year":"2002","unstructured":"Carson, C., Belongie, S., Greenspan, H., Malik, J.: Blobworld: Image segmentation using expectation-maximization and its application to image querying. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a024(8), 1026\u20131038 (2002)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"9_CR18","unstructured":"G\u00f3mez, E., Mic\u00f3, L., Oncina, J.: Testing the linear approximating eliminating search algorithm in handwritten character recognition tasks. In: VI Symposium Nacional de reconocimiento de Formas y An\u00e1lisis de Im\u00e1genes, pp. 212\u2013217 (1995)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74958-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T21:46:43Z","timestamp":1737409603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74958-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540749578","9783540749585"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74958-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}