{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:18Z","timestamp":1725487098924},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728481"},{"type":"electronic","value":"9783540728498"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72849-8_39","type":"book-chapter","created":{"date-parts":[[2007,7,5]],"date-time":"2007-07-05T15:29:11Z","timestamp":1183649351000},"page":"306-313","source":"Crossref","is-referenced-by-count":4,"title":["A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms"],"prefix":"10.1007","author":[{"given":"Jose","family":"Oncina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franck","family":"Thollard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eva","family":"G\u00f3mez-Ballester","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Mic\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Moreno-Seco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proceedings of the 21\n                  st\n                 VLDB Conference, pp. 574\u2013584 (1995)","key":"39_CR1"},{"issue":"3","key":"39_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroquin, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"39_CR3","volume-title":"Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques","author":"B.V. Dasarathy","year":"1991","unstructured":"Dasarathy, B.V.: Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"39_CR4","volume-title":"Pattern Classification","author":"R.O. Duda","year":"2000","unstructured":"Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley, New York (2000)","edition":"2"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J.H. Friedman","year":"1977","unstructured":"Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software\u00a03, 209\u2013226 (1977)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/T-C.1975.224297","volume":"24","author":"K. Fukunaga","year":"1975","unstructured":"Fukunaga, K., Narendra, P.M.: A branch and bound algorithm for computing k-nearest neighbors. IEEE Transactions on Computers, IEC\u00a024, 750\u2013753 (1975)","journal-title":"IEEE Transactions on Computers, IEC"},{"key":"39_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/978-3-540-24586-5_56","volume-title":"Progress in Pattern Recognition, Speech and Image Analysis","author":"E. G\u00f3mez-Ballester","year":"2003","unstructured":"G\u00f3mez-Ballester, E., Mic\u00f3, L., Oncina, J.: Some improvements in tree based nearest neighbour search algorithms. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol.\u00a02905, pp. 456\u2013463. Springer, Heidelberg (2003)"},{"issue":"2","key":"39_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.patcog.2005.06.007","volume":"39","author":"E. G\u00f3mez-Ballester","year":"2006","unstructured":"G\u00f3mez-Ballester, E., Mic\u00f3, L., Oncina, J.: Some approaches to improve tree-based nearest neighbour search algorithms. Pattern Recognition\u00a039(2), 171\u2013179 (2006)","journal-title":"Pattern Recognition"},{"issue":"9","key":"39_CR9","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/34.955110","volume":"23","author":"J. McNames","year":"2001","unstructured":"McNames, J.: A fast nearest neighbor algorithm based on a principal axis tree. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a023(9), 964\u2013976 (2001)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 311\u2013321 (1993)","key":"39_CR10"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72849-8_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:06:30Z","timestamp":1605762390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72849-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728481","9783540728498"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72849-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}