{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:39:52Z","timestamp":1725518392816},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859192"},{"type":"electronic","value":"9783540859208"}],"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-85920-8_45","type":"book-chapter","created":{"date-parts":[[2008,9,16]],"date-time":"2008-09-16T04:05:25Z","timestamp":1221537925000},"page":"364-371","source":"Crossref","is-referenced-by-count":0,"title":["Fast k Most Similar Neighbor Classifier for Mixed Data Based on a Tree Structure and Approximating-Eliminating"],"prefix":"10.1007","author":[{"given":"Selene","family":"Hern\u00e1ndez-Rodr\u00edguez","sequence":"first","affiliation":[]},{"given":"J. A.","family":"Carrasco-Ochoa","sequence":"additional","affiliation":[]},{"given":"J. Fco.","family":"Mart\u00ednez-Trinidad","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T.M. Cover","year":"1967","unstructured":"Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. Trans. Information Theory\u00a013, 21\u201327 (1967)","journal-title":"Trans. Information Theory"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"P.E. Vidal","year":"1986","unstructured":"Vidal, P.E.: An algorithm for finding nearest neighbours in (approximately) constant average time complexity. Pattern Recognition Letters\u00a04, 145\u2013157 (1986)","journal-title":"Pattern Recognition Letters"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"L. Mic\u00f3","year":"1994","unstructured":"Mic\u00f3, L., Oncina, J., Vidal, E.: A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing-time and memory requirements. Pattern Recognition Letters\u00a015, 9\u201317 (1994)","journal-title":"Pattern Recognition Letters"},{"key":"45_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/11764298_26","volume-title":"Experimental Algorithms","author":"K. Figueroa","year":"2006","unstructured":"Figueroa, K., Ch\u00e1vez, E., Navarro, G., Paredes, R.: On the least cost for proximity searching in metric spaces. In: \u00c0lvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol.\u00a04007, pp. 279\u2013290. Springer, Heidelberg (2006)"},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/0167-8655(96)00032-3","volume":"17","author":"L. Mico","year":"1996","unstructured":"Mico, L., Oncina, J., Carrasco, R.: A fast Branch and Bound nearest neighbor classifier in metric spaces. Pattern Recognition Letters\u00a017, 731\u2013739 (1996)","journal-title":"Pattern Recognition Letters"},{"key":"45_CR6","unstructured":"Tokoro, K., Yamaguchi, K., Masuda, S.: Improvements of TLAESA nearest neighbor search and extension to approximation search. In: ACSC 2006: Proceedings of the 29th Australian Computer Science Conference, pp. 77\u201383 (2006)"},{"key":"45_CR7","first-page":"743","volume":"24","author":"K. Fukunaga","year":"1975","unstructured":"Fukunaga, K., Narendra, P.: A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. Comput.\u00a024, 743\u2013750 (1975)","journal-title":"IEEE Trans. Comput."},{"key":"45_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-540-24586-5_39","volume-title":"Progress in Pattern Recognition, Speech and Image Analysis","author":"F. Moreno-Seco","year":"2003","unstructured":"Moreno-Seco, F., Mico, L., Oncina, J.: Approximate Nearest Neighbor Search with the Fukunaga and Narendra Algorithm and its Application to Chromosome Classification. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol.\u00a02905, pp. 322\u2013328. Springer, Heidelberg (2003)"},{"key":"45_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-72849-8_39","volume-title":"Pattern Recognition and Image Analysis","author":"J. Oncina","year":"2007","unstructured":"Oncina, J., Thollard, F., G\u00f3mez-Ballester, E., Mic\u00f3, L., Moreno-Seco, F.: A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms. In: Mart\u00ed, J., Bened\u00ed, J.M., Mendon\u00e7a, A.M., Serrat, J. (eds.) IbPRIA 2007. LNCS, vol.\u00a04478, pp. 306\u2013313. Springer, Heidelberg (2007)"},{"key":"45_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-48247-5_42","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"J.R. Garc\u00eda-Serrano","year":"1999","unstructured":"Garc\u00eda-Serrano, J.R., Mart\u00ednez-Trinidad, J.F.: Extension to C-Means Algorithm for the use of Similarity Functions. In: \u017bytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol.\u00a01704, pp. 354\u2013359. Springer, Heidelberg (1999)"},{"key":"45_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-76725-1_43","volume-title":"Progress in Pattern Recognition, Image Analysis and Applications","author":"S. Hern\u00e1ndez-Rodr\u00edguez","year":"2007","unstructured":"Hern\u00e1ndez-Rodr\u00edguez, S., Mart\u00ednez-Trinidad, J., Carrasco-Ochoa, A.: Fast k Most Similar Neighbor Classifier for Mixed Data Based on a Tree Structure. In: Rueda, L., Mery, D., Kittler, J. (eds.) CIARP 2007. LNCS, vol.\u00a04756, pp. 407\u2013416. Springer, Heidelberg (2007)"},{"key":"45_CR12","unstructured":"Blake, C., Merz, C.U.: Repository of machine learning databases. Department of Information and Computer Science, University of California, Irvine, CA (1998), \n                      \n                        http:\/\/www.uci.edu\/mlearn\/databases\/"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85920-8_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T04:48:38Z","timestamp":1551588518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85920-8_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859192","9783540859208"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85920-8_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}