{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,20]],"date-time":"2026-10-20T22:07:08Z","timestamp":1792534028316,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425601","type":"print"},{"value":"9783540448082","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44808-x_14","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T20:32:08Z","timestamp":1178224328000},"page":"172-187","source":"Crossref","is-referenced-by-count":4,"title":["An Empirical Study of a New Approach to Nearest Neighbor Searching"],"prefix":"10.1007","author":[{"given":"Songrit","family":"Maneewongvatana","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David M.","family":"Mount","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,9,11]]},"reference":[{"key":"14_CR1","unstructured":"S. Arya and D. M. Mount. Approximate nearest neighbor queries in fixed dimensions. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 271\u2013280, 1993."},{"key":"14_CR2","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":"14_CR3","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, 45:891\u2013923, 1998.","journal-title":"Journal of the ACM"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Conf. on Management of Data, pages 322\u2013331, 1990.","DOI":"10.1145\/93597.98741"},{"key":"14_CR5","unstructured":"S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-tree: An index structure for high-dimensional data. In Proc. 22nd VLDB Conference, pages 28\u201339, 1996."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0190(93)90222-U","volume":"45","author":"M. Bern","year":"1993","unstructured":"M. Bern. Approximate closest-point queries in high dimensions. Inform. Process. Lett., 45:95\u201399, 1993.","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1009715923555","volume":"2","author":"C. J.C. Burges","year":"1998","unstructured":"C. J.C. Burges. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2(2):121\u2013167, 1998.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"T. Chan. Approximate nearest neighbor queries revisited. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 352\u2013358, 1997.","DOI":"10.1145\/262839.263001"},{"key":"14_CR9","unstructured":"C. Chang and C. Lin. LIBSVM: Introduction and benchmarks. LIBSVM can be obtained from URL: http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm , 1999."},{"key":"14_CR10","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":"14_CR11","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":"14_CR12","first-page":"57","volume":"10","author":"S. Cost","year":"1993","unstructured":"S. Cost and S. Salzberg. A weighted nearest neighbor algorithm for learning with symbolic features. Machine Learning, 10:57\u201378, 1993.","journal-title":"Machine Learning"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T. M. Cover","year":"1967","unstructured":"T. M. Cover and P. E. Hart. Nearest neighbor pattern classification. IEEE Trans. Inform. Theory, 13:57\u201367, 1967.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"14_CR14","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"},{"issue":"6","key":"14_CR15","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S. Deerwester","year":"1990","unstructured":"S. Deerwester, S. T. Dumais, G. W. Furnas, T. K. Landauer, and R. Harshman. Indexing by latent semantic analysis. J. Amer. Soc. Inform. Sci., 41(6):391\u2013407, 1990.","journal-title":"J. Amer. Soc. Inform. Sci."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"L. Devroye and T. J. Wagner. Nearest neighbor methods in discrimination. In P. R. Krishnaiah and L. N. Kanal, editors, Handbook of Statistics, volume 2. North-Holland, 1982.","DOI":"10.1016\/S0169-7161(82)02011-2"},{"key":"14_CR17","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, NY, 1973."},{"key":"14_CR18","unstructured":"C. Duncan, M. Goodrich, and S. Kobourov. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. In Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pages 300\u2013309, 1999."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Christos Faloutsos and Ibrahim 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":"14_CR20","unstructured":"U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy. Advances in Knowledge Discovery and Data Mining. AAAI Press\/MIT Press, 1996."},{"key":"14_CR21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/2.410146","volume":"28","author":"M. Flickner","year":"1995","unstructured":"M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker. Query by image and video content: The QBIC system. IEEE Computer, 28:23\u201332, 1995.","journal-title":"IEEE Computer"},{"issue":"3","key":"14_CR22","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":"14_CR23","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":"14_CR24","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, 1992."},{"key":"14_CR25","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":"14_CR26","doi-asserted-by":"crossref","unstructured":"N. Katayama and S. Satoh. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In Proc. ACM SIGMOD Conf. on Management of Data, pages 369\u2013380, 1997.","DOI":"10.1145\/253260.253347"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"J. M. Kleinberg. Two algorithms for nearest-neighbor search in high dimension. In Proc. 29th Annu. ACM Sympos. Theory Comput., pages 599\u2013608, 1997.","DOI":"10.1145\/258533.258653"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimemsional spaces. In Proc. 30th Annu. ACM Sympos. Theory Comput., pages 614\u2013623, 1998.","DOI":"10.1145\/276698.276877"},{"issue":"4","key":"14_CR29","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K. I. Lin","year":"1994","unstructured":"K. I. Lin, H. V. Jagadish, and C. Faloutsos. The TV-tree: An index structure for high-dimensional data. VLDB Journal, 3(4):517\u2013542, 1994.","journal-title":"VLDB Journal"},{"key":"14_CR30","unstructured":"D. M. Mount and S. Arya. ANN: A library for approximate nearest neighbor searching. Center for Geometric Computing 2nd Annual Fall Workshop on Computational Geometry, URL: http:\/\/www.cs.umd.edu\/~mount\/ANN , 1997."},{"key":"14_CR31","unstructured":"F. Murtagh. PC A (principal components analysis): C program. PC A program can be obtained from URL: http:\/\/astro.u-strasbg.fr\/~fmurtagh\/mda-sw\/pca.c , 1989."},{"key":"14_CR32","unstructured":"D. Saupe, 1994. Private communication."},{"key":"14_CR33","unstructured":"T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-tree: A dynamic index for multi-dimensional objects. In Proc. 13th VLDB Conference, pages 507\u2013517, 1987."},{"key":"14_CR34","volume-title":"Statistical Learning Theory","author":"V. Vapnik","year":"1998","unstructured":"V. Vapnik. Statistical Learning Theory. John Wiley & Sons, NY, 1998."},{"key":"14_CR35","unstructured":"K. Zatloukal, M. H. Johnson, and R. Ladner. Nearest neighbor search for data compression. (Presented at the 6th DIMACS Implementation Challenge Workshop), URL: http:\/\/www.cs.washington.edu\/homes\/ladner\/nns.ps , 1999."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experimentation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44808-X_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:17:03Z","timestamp":1556374623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44808-X_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425601","9783540448082"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-44808-x_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}