Skip to main content
SpringerLink
Log in
Book cover

Computational Discrete Mathematics pp 13–24Cite as

The Nearest Neighbor

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2122))

Abstract

The nearest neighbor problem is defined as follows: Given a metric space X and a fixed finite subset S ⊂ X of n “sites”, preprocess S and build a data structure so that queries of the following kind can be answered efficiently: Given a point q ∈ X find one of the points p ∈ S closest to q (see Figure 1).

The nearest-neighbor problem in the plane with Euclidean distance

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Alt, L. Heinrich-Litan, U. Hoffmann. Exact ∓∞ nearest neighbor search in high dimensions. Technical report, Institute for Computer Science, FU Berlin, in preparation.

    Google Scholar 

  2. S. Arya and D. M. Mount. Approximate nearest neighbor queries in fixed dimensions. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 271–280, 1993.

    Google Scholar 

  3. F. Aurenhammer. Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3):345–405, Sept. 1991.

    Google Scholar 

  4. J.-D. Boissonnat and M. Yvinec. Algorithmic Geometry. Cambridge University Press, UK, 1998. Translated by Hervé Brönnimann.

    MATH  Google Scholar 

  5. L. Clarkson. A randomized algorithm for closest-point queries. SIAM J. Comput., 17:830–847, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  6. L. Devroye and T. Wagner. Nearest neighbor methods in discrimination. In North-Holland, editor, Handbook of Statistics, volume 2. P.R. Krishnaiah, L.N. Kanal, 1982.

    Google Scholar 

  7. D. P. Dobkin and R. J. Lipton. Multidimensional searching problems. SIAM J. Comput., 5:181–186, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. Duda and P. Hart. Pattern Classification and Scene Analysis. Wiley, 1973.

    Google Scholar 

  9. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. WileyInterscience, New York, 1973.

    MATH  Google Scholar 

  10. 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. Computer, 28:23–32, 1995.

    Article  Google Scholar 

  11. P. Frankl and H. Maehara. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. Journal of Combinatorial Theory B, 44:355–362, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  12. A. Gersho and R. M. Gray. Vector Quantization and Signal Compression. Kluwer Academic Press, 1991.

    Google Scholar 

  13. L. Heinrich-Litan. PhD thesis, FU Berlin, in preparation.

    Google Scholar 

  14. P. Indyk. Dimensionality reduction techniques for proximity problems. In Proceedings, ACM Symposium on Data Structures and Algorithms, SODA 2000, pages 371–378, 2000.

    Google Scholar 

  15. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. 30th Annu. ACM Sympos. Theory Comput., page to appear, 1998.

    Google Scholar 

  16. W. Johnson and G. Schechtman. Embedding ∓ m p into ∓ n 1 . Acta Mathematica, 149:71–85, 1985.

    Article  MathSciNet  Google Scholar 

  17. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal on Computing, 12:28–35, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  18. R. Klein. Algorithmische Geometrie. Addison-Wesley, Bonn, 1997.

    MATH  Google Scholar 

  19. J. Kleinberg. Two algorithms for nearest-neighbor search in high dimension. In Proc. 29th Annu. ACM Sympos. Theory Comput., pages 599–608, 1997.

    Google Scholar 

  20. D. Knuth. The art of computer programming. Addison-Wesley, 1973.

    Google Scholar 

  21. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. In Proc. 30th Annu. ACM Sympos. Theory Comput., page to appear, 1998.

    Google Scholar 

  22. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215–245, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  23. S. Meiser. Point location in arrangements of hyperplanes. Inform. Comput., 106:286–303, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  24. M. Minsky and S. Papert. Perceptrons. MIT Press, Cambridge MA, 1969.

    MATH  Google Scholar 

  25. A. Okabe, B. Boots, and K. Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester, UK, 1992.

    MATH  Google Scholar 

  26. A. W. M. Smeulders and (eds.). Image databases and multi-media search. In Proceedings of the First International Workshop, IDB-MMS ‘96, Amsterdam, 1996. Amsterdam University Press.

    Google Scholar 

  27. C. J. van Rijsbergen. Information Retrieval. Butterworths, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Free University of Berlin, Takustr.9, 14195, Berlin, Germany

    Helmut Alt

Authors
  1. Helmut Alt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Freie Universität Berlin, Takustr. 9, 14195, Berlin, Germany

    Helmut Alt

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Alt, H. (2001). The Nearest Neighbor. In: Alt, H. (eds) Computational Discrete Mathematics. Lecture Notes in Computer Science, vol 2122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45506-X_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45506-X_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42775-9

  • Online ISBN: 978-3-540-45506-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation