{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:24:58Z","timestamp":1778300698480,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424239","type":"print"},{"value":"9783540446347","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44634-6_26","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:20:48Z","timestamp":1186741248000},"page":"276-286","source":"Crossref","is-referenced-by-count":2,"title":["The Analysis of a Probabilistic Approach to Nearest Neighbor Searching"],"prefix":"10.1007","author":[{"given":"Songrit","family":"Maneewongvatana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David M.","family":"Mount","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"26_CR1","unstructured":"S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. In Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pages 573\u2013582, 1994."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"P. Ciaccia and M. Patella. Using the distance distribution for approximate similarity queries in high-dimensional metric spaces. In Proc. 10th Workshop Database and Expert Systems Applications, pages 200\u2013205, 1999.","DOI":"10.1109\/DEXA.1999.795166"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"K. L. Clarkson. An algorithm for approximate closest-point queries. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 160\u2013164, 1994.","DOI":"10.1145\/177424.177609"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 1997.","DOI":"10.1007\/978-3-662-03427-9"},{"key":"26_CR5","volume-title":"Pattern Classification and Scene Analysis","author":"R. O. Duda","year":"1973","unstructured":"R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley & Sons, New York, NY, 1973."},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"C. Faloutsos and I. Kamel. Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension. In Proc. Annu. ACM Sympos. Principles Database Syst., pages 4\u201313, 1994.","DOI":"10.1145\/182591.182593"},{"key":"26_CR7","unstructured":"U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy. Advances in Knowledge Discovery and Data Mining. AAAI Press\/Mit Press, 1996."},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J. H. Friedman","year":"1977","unstructured":"J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Software, 3(3):209\u2013226, 1977.","journal-title":"ACM Trans. Math. Software"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"K. Fukunaga. Introduction to Statistical Pattern Recognition. Academic Press, 2nd edition, 1990.","DOI":"10.1016\/B978-0-08-047865-4.50007-7"},{"key":"26_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3626-0","volume-title":"Vector Quantization and Signal Compression","author":"A. Gersho","year":"1992","unstructured":"A. Gersho and R. M. Gray. Vector Quantization and Signal Compression. Kluwer Academic, Boston, MA, 1992."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. 30th Annu. ACM Sympos. Theory Comput., pages 604\u2013613, 1998.","DOI":"10.1145\/276698.276876"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"S. Maneewongvatana and D. Mount. An empirical study of a new approach to nearest nearbor searching. In ALENEX, 2001.","DOI":"10.1007\/3-540-44808-X_14"},{"key":"26_CR13","volume-title":"Statistical Learning Theory","author":"V. Vapnik","year":"1998","unstructured":"V. Vapnik. Statistical Learning Theory. John Wiley & Sons, New York, NY, 1998."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44634-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:12:18Z","timestamp":1556748738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44634-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424239","9783540446347"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44634-6_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}