{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:12:11Z","timestamp":1725563531618},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642149795"},{"type":"electronic","value":"9783642149801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14980-1_7","type":"book-chapter","created":{"date-parts":[[2010,8,28]],"date-time":"2010-08-28T10:05:23Z","timestamp":1282989923000},"page":"80-89","source":"Crossref","is-referenced-by-count":1,"title":["Combining Elimination Rules in Tree-Based Nearest Neighbor Search Algorithms"],"prefix":"10.1007","author":[{"given":"Eva","family":"G\u00f3mez-Ballester","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Mic\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franck","family":"Thollard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Oncina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Moreno-Seco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"ICDM 2002: Proceedings of the 2002 IEEE International Conference on Data Mining","author":"C. B\u00f6hm","year":"2002","unstructured":"B\u00f6hm, C., Krebs, F.: High performance data mining using the nearest neighbor join. In: ICDM 2002: Proceedings of the 2002 IEEE International Conference on Data Mining. IEEE Computer Society, Los Alamitos (2002)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1145\/253260.253345","volume-title":"SIGMOD 1997: Proceedings of the 1997 ACM SIGMOD international conference on Management of data","author":"T. Bozkaya","year":"1997","unstructured":"Bozkaya, T., Ozsoyoglu, M.: Distance-based indexing for high-dimensional metric spaces. In: SIGMOD 1997: Proceedings of the 1997 ACM SIGMOD international conference on Management of data, pp. 357\u2013368. ACM, New York (1997)"},{"key":"7_CR3","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: VLDB Conference, pp. 574\u2013584 (1995)"},{"key":"7_CR4","first-page":"426","volume-title":"VLDB Conference","author":"P. Ciaccia","year":"1997","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: VLDB Conference, pp. 426\u2013435. Morgan Kaufmann Publishers, Inc., San Francisco (1997)"},{"key":"7_CR5","unstructured":"Dasarathy, B.V.: Data mining tasks and methods: Classification: nearest-neighbor approaches, pp. 288\u2013298 (2002)"},{"key":"7_CR6","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":"7_CR7","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":"7_CR8","series-title":"LNAI","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 (LNAI), vol.\u00a02905, pp. 456\u2013463. Springer, Heidelberg (2003)"},{"issue":"2","key":"7_CR9","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"},{"key":"7_CR10","first-page":"141","volume-title":"SPIRE 1999: Proceedings of the String Processing and Information Retrieval Symposium","author":"G. Navarro","year":"1999","unstructured":"Navarro, G.: Searching in metric spaces by spatial approximation. In: SPIRE 1999: Proceedings of the String Processing and Information Retrieval Symposium, p. 141. IEEE Computer Society, Los Alamitos (1999)"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/3-540-55488-2_27","volume-title":"Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative","author":"H. Noltemeier","year":"1992","unstructured":"Noltemeier, H., Verbarg, K., Zirkelbach, C.: Monotonous bisector* trees - a tool for efficient partitioning of complex scenes of geometric objects. In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, London, UK, pp. 186\u2013203. Springer, Heidelberg (1992)"},{"key":"7_CR12","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 pruning rule fast nearest neighbour 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":"7_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4908.001.0001","volume-title":"Nearest-Neighbor Methods in Learning and Vision","author":"G. Shakhnarovich","year":"2006","unstructured":"Shakhnarovich, G., Darrell, T., Indyk, P.: Nearest-Neighbor Methods in Learning and Vision. MIT Press, Cambridge (2006)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8655(94)90094-9","volume":"15","author":"E. Vidal","year":"1994","unstructured":"Vidal, E.: New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA). Pattern Recognition Letters\u00a015, 1\u20137 (1994)","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"7_CR15","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the Association for Computing Machinery\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"7_CR16","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)"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14980-1_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:00:15Z","timestamp":1606186815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14980-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642149795","9783642149801"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14980-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}