{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T04:48:00Z","timestamp":1749271680801,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540453758"},{"type":"electronic","value":"9783540460565"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11871842_9","type":"book-chapter","created":{"date-parts":[[2006,9,18]],"date-time":"2006-09-18T08:28:47Z","timestamp":1158568127000},"page":"42-53","source":"Crossref","is-referenced-by-count":7,"title":["Learning Stochastic Tree Edit Distance"],"prefix":"10.1007","author":[{"given":"Marc","family":"Bernard","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":[{"issue":"1-3","key":"9_CR1","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":"5","key":"9_CR2","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_CR3","doi-asserted-by":"crossref","unstructured":"Oncina, J., Sebban, M.: Learning stochastic edit distance: application in handwritten character recognition. Journal of Pattern Recognition (to appear, 2006)","DOI":"10.1016\/j.patcog.2006.03.011"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"McCallum, A., Bellare, K., Pereira, P.: A conditional random field for disciminatively-trained finite-state sting edit distance. In: UAI 2005 (2005)","DOI":"10.21236\/ADA440386"},{"key":"9_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511790492","volume-title":"Biological sequence analysis","author":"R. Durbin","year":"1998","unstructured":"Durbin, R., Eddy, S., Krogh, A., Mitchison, G.: Biological sequence analysis. Cambridge University Press, Cambridge (1998)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/ICPR.2004.1334548","volume-title":"17th Int. Conf. on Pattern Recognition","author":"M. Neuhaus","year":"2004","unstructured":"Neuhaus, M., Bunke, H.: A probabilistic approach to learning costs for graph edit distance. In: 17th Int. Conf. on Pattern Recognition, pp. 389\u2013393. IEEE, Los Alamitos (2004)"},{"key":"9_CR7","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_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-68530-8_8","volume-title":"Algorithms - ESA \u201998","author":"P. Klein","year":"1998","unstructured":"Klein, P.: Computing the edit-distance between unrooted ordered trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 91\u2013102. Springer, Heidelberg (1998)"},{"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","volume-title":"COMPSTAT 2004","author":"G. Bouchard","year":"2004","unstructured":"Bouchard, G., Triggs, B.: The trade-off between generative and discrminative classifiers. In: COMPSTAT 2004. Springer, Heidelberg (2004)"},{"issue":"39","key":"9_CR11","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."}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11871842_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T21:51:02Z","timestamp":1736545862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11871842_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540453758","9783540460565"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11871842_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}