On the efficiency of nearest neighbor searching with data clustered in lower dimensions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2073, Issue , 2001, Pages 842-851

  Maneewongvatana, Songrit ^a   Mount, David M ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 80755129679     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45545-0_96     Document Type: Conference Paper

References (16)

1. S. Arya, D. M. Mount, and O. Narayan. Accounting for boundary effects in nearest neighbor searching. Discrete Comput. Geom., 16(2):155–176, 1996.
2. 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–923, 1998.
3. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509–517, 1975.
4. M. Bern, D. Eppstein, and S.-H. Teng. Parallel construction of quadtrees and quality triangulations. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 188–199. Springer-Verlag, 1993.
5. J. L. Bentley, B. W. Weide, and A. C. Yao. Optimal expected-time algo-rithms for closest-point problems. ACM Trans. Math. Software, 6(4):563– 580, 1980.
6. J. G. Cleary. Analysis of an algorithm for finding nearest neighbors in euclidean space. ACM Trans. Math. Software, 5(2):183–192, 1979.
7. M. Carreira-Perpiñán. A review of dimension reduction techniques. Tech-nical Report CS–96–09, Dept. of Computer Science, University of Sheffield, UK, 1996.
8. 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–309, 1999.
9. 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–226, 1977.
10. Christos Faloutsos and Ibrahim Kamel. Beyond uniformity and indepen-dence: Analysis of R-trees using the concept of fractal dimension. In Proc. Annu. ACM Sympos. Principles Database Syst., pages 4–13, 1994.
11. K. Fukunaga. Introduction to Statistical Pattern Recognition. Academic Press, 2nd edition, 1990.
12. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards re-moving the curse of dimensionality. In Proc. 30th Annu. ACM Sympos. Theory Comput., pages 604–613, 1998.
13. J. M. Kleinberg. Two algorithms for nearest-neighbor search in high di-mension. In Proc. 29th Annu. ACM Sympos. Theory Comput., pages 599– 608, 1997.
14. D. M. Mount and S. Arya. ANN: A library for approximate nearest neighbor searching. Center for Geometric Computing 2nd Annual Workshop on Computational Geometry, 1997.
15. S. Maneewongvatana and D. Mount. Analysis of approximate nearest neighbor searching with clustered point sets. In ALENEX, 1999. S. Maneewongvatana and D. Mount. It’s okay to be skinny, if your friends are fat. Center for Geometric Computing 4th Annual Workshop on Com-putational Geometry, 1999.
16. S. Maneewongvatana and D. Mount. On the efficiency of nearest neighbor searching with data clustered in lower dimensions. Technical Report CS-TR-4209, Dept. Computer Science, Univ. Maryland, 2001.