{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:46:23Z","timestamp":1743043583712,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540896883"},{"type":"electronic","value":"9783540896890"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89689-0_85","type":"book-chapter","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T12:32:14Z","timestamp":1228134734000},"page":"811-820","source":"Crossref","is-referenced-by-count":0,"title":["Use of Structured Pattern Representations for Combining Classifiers"],"prefix":"10.1007","author":[{"given":"Raisa","family":"Socorro","sequence":"first","affiliation":[]},{"given":"Luisa","family":"Mic\u00f3","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"85_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471660264","volume-title":"Combining Pattern Classifiers: methods and algorithms","author":"L. Kuncheva","year":"2004","unstructured":"Kuncheva, L.: Combining Pattern Classifiers: methods and algorithms. Wiley, Chichester (2004)"},{"key":"85_CR2","doi-asserted-by":"crossref","unstructured":"Duin, R.: The combining classifier: to train or not to train? In: Proceedings of the International Conference on Pattern Recognition ICPR 2002, Quebec Canada, vol.\u00a0II, pp. 765\u2013770 (2002)","DOI":"10.1109\/ICPR.2002.1048415"},{"issue":"10","key":"85_CR3","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1016\/j.patcog.2006.04.012","volume":"39","author":"M. Neuhaus","year":"2006","unstructured":"Neuhaus, M., Bunke, H.: Edit distance-based kernel functions for structural pattern classification. Pattern Recognition\u00a039(10), 1852\u20131863 (2006)","journal-title":"Pattern Recognition"},{"key":"85_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/11815921_31","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"B. Spillmann","year":"2006","unstructured":"Spillmann, B., Neuhaus, M., Bunke, H., Pekalska, E., Duin, R.: Transforming strings to vector spaces using prototype selection. In: Yeung, D.-Y., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds.) SSPR 2006 and SPR 2006. LNCS, vol.\u00a04109, pp. 287\u2013296. Springer, Heidelberg (2006)"},{"key":"85_CR5","unstructured":"Grother, P.: Handprinted forms and character database. In: NIST Special Database 19 (2001)"},{"key":"85_CR6","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/0167-8655(95)00121-V","volume":"16","author":"R. Carrasco","year":"2003","unstructured":"Carrasco, R., Forcada, M.: A note on the Nagendraprasad-Wnag-Gupta thinning algorithm. Patter Recognition Letters\u00a016, 539\u2013541 (2003)","journal-title":"Patter Recognition Letters"},{"issue":"9","key":"85_CR7","first-page":"1427","volume":"24","author":"J. Rico","year":"2003","unstructured":"Rico, J., Mic\u00f3, L.: Comparison of aesa and laesa search algorithms using string and tree edit distances. Pattern Recognition Letters\u00a024(9), 1427\u20131436 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"85_CR8","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput.\u00a018, 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."},{"key":"85_CR9","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"211","author":"R. Wagner","year":"1974","unstructured":"Wagner, R., Fischer, M.: The string-to-string correction problem. Journal of the Association for Computing Machinery\u00a0211, 168\u2013173 (1974)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"85_CR10","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1109\/34.667881","volume":"20","author":"J. Kittler","year":"1998","unstructured":"Kittler, J., Hatef, M., Duin, R., Matas, J.: On combining classifiers. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a020, 226\u2013239 (1998)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"85_CR11","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TPAMI.2003.1195989","volume":"25","author":"G. Hjaltason","year":"2003","unstructured":"Hjaltason, G., Samet, H.: Properties of embedding methods for similarity searching in metric spaces. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a025, 530\u2013549 (2003)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"85_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/BFb0033285","volume-title":"Advances in Pattern Recognition","author":"R.P.W. Duin","year":"1998","unstructured":"Duin, R.P.W., Tax, D.M.J.: Classifier conditional posterior probabilities. In: Amin, A., Pudil, P., Dori, D. (eds.) SPR 1998 and SSPR 1998. LNCS, vol.\u00a01451, pp. 611\u2013619. Springer, Heidelberg (1998)"},{"key":"85_CR13","first-page":"576","volume-title":"16th International Conference on Pattern Recognition ICPR 2002","author":"J. Arlandis","year":"2002","unstructured":"Arlandis, J., Perez-Cortes, J.C., Cano, J.: Rejection strategies and confidence measures for a k-nn classifier in an ocr task. In: 16th International Conference on Pattern Recognition ICPR 2002, pp. 576\u2013579. IEEE, Los Alamitos (2002)"},{"key":"85_CR14","doi-asserted-by":"crossref","unstructured":"Athitsos, V., Alon, J., Sclaroff, S.: Efficient nearest neighbor classification using a cascade of approximate similarity measures. In: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2005), vol.\u00a01, pp. 486\u2013493 (2005)","DOI":"10.1109\/CVPR.2005.141"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89689-0_85","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T01:41:57Z","timestamp":1738719717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89689-0_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540896883","9783540896890"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89689-0_85","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}