{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:21:31Z","timestamp":1726410091205},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642386275"},{"type":"electronic","value":"9783642386282"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38628-2_67","type":"book-chapter","created":{"date-parts":[[2013,5,22]],"date-time":"2013-05-22T02:52:37Z","timestamp":1369191157000},"page":"567-574","source":"Crossref","is-referenced-by-count":0,"title":["Which Fast Nearest Neighbour Search Algorithm to Use?"],"prefix":"10.1007","author":[{"given":"Aureo","family":"Serrano","sequence":"first","affiliation":[]},{"given":"Luisa","family":"Mic\u00f3","sequence":"additional","affiliation":[]},{"given":"Jose","family":"Oncina","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"67_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"3","key":"67_CR2","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 Trans. Math. Softw.\u00a03(3), 209\u2013226 (1977)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"67_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1109\/TSE.1979.234200","volume":"5","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L.: Multidimensional binary search trees in database applications. IEEE Trans. Softw. Eng.\u00a05(4), 333\u2013340 (1979)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"2","key":"67_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/971697.602266","volume":"14","author":"A. Guttman","year":"1984","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. SIGMOD Rec.\u00a014(2), 47\u201357 (1984)","journal-title":"SIGMOD Rec."},{"issue":"2","key":"67_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"Samet, H.: The quadtree and related hierarchical data structures. ACM Comput. Surv.\u00a016(2), 187\u2013260 (1984)","journal-title":"ACM Comput. Surv."},{"key":"67_CR6","first-page":"451","volume-title":"Readings in multimedia computing and networking","author":"S. Berchtold","year":"2001","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.P.: Readings in multimedia computing and networking, pp. 451\u2013462. Morgan Kaufmann Publishers Inc., San Francisco (2001)"},{"key":"67_CR7","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/0167-8655(96)00032-3","volume":"17","author":"L. Mic\u00f3","year":"1996","unstructured":"Mic\u00f3, L., Oncina, J., Carrasco, R.: A fast branch and bound nearest neighbor classifier in metric spaces. Pattern Recognition Letters\u00a017, 731\u2013773 (1996)","journal-title":"Pattern Recognition Letters"},{"issue":"2","key":"67_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"},{"key":"67_CR9","unstructured":"Yianilos, P.: 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":"67_CR10","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proceedings of the 21st International Conference on Very Large Data Bases, pp. 574\u2013584 (1995)"},{"key":"67_CR11","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd International Conference on VLDB, Athens, Greece, pp. 426\u2013435. Morgan Kaufmann Publishers (1997)"},{"key":"67_CR12","unstructured":"Mount, D.M., Arya, S.: Ann: A library for approximate nearest neighbor searching (2010)"},{"key":"67_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-55488-2_27","volume-title":"Data Structures and Efficient Algorithms","author":"H. Noltemeier","year":"1992","unstructured":"Noltemeier, H., Verbarg, K., Zirkelbach, C.: Monotonous bisector* trees \u2013 a tool for efficient partitioning of complex scenes of geometric objects. In: Monien, B., Ottmann, T. (eds.) Data Structures and Efficient Algorithms. LNCS, vol.\u00a0594, pp. 186\u2013203. Springer, Heidelberg (1992)"},{"key":"67_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-24471-1_12","volume-title":"Similarity-Based Pattern Recognition","author":"A. Serrano","year":"2011","unstructured":"Serrano, A., Mic\u00f3, L., Oncina, J.: Impact of the initialization in tree-based fast similarity search techniques. In: Pelillo, M., Hancock, E.R. (eds.) SIMBAD 2011. LNCS, vol.\u00a07005, pp. 163\u2013176. Springer, Heidelberg (2011)"},{"issue":"4","key":"67_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J.K. Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/similarity queries with metric trees. Inf. Process. Lett.\u00a040(4), 175\u2013179 (1991)","journal-title":"Inf. Process. Lett."},{"key":"67_CR16","unstructured":"Figueroa, K., Navarro, G., Ch\u00e1vez, E.: Metric spaces library (2007), \n                      \n                        http:\/\/www.sisap.org\/Metric_Space_Library.html"},{"key":"67_CR17","unstructured":"Frank, A., Asuncion, A.: UCI machine learning repository (2010)"},{"issue":"3","key":"67_CR18","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.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38628-2_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:09:36Z","timestamp":1557706176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38628-2_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642386275","9783642386282"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38628-2_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}