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).
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. Alt, L. Heinrich-Litan, U. Hoffmann. Exact ∓∞ nearest neighbor search in high dimensions. Technical report, Institute for Computer Science, FU Berlin, in preparation.
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.
F. Aurenhammer. Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3):345–405, Sept. 1991.
J.-D. Boissonnat and M. Yvinec. Algorithmic Geometry. Cambridge University Press, UK, 1998. Translated by Hervé Brönnimann.
L. Clarkson. A randomized algorithm for closest-point queries. SIAM J. Comput., 17:830–847, 1988.
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.
D. P. Dobkin and R. J. Lipton. Multidimensional searching problems. SIAM J. Comput., 5:181–186, 1976.
R. Duda and P. Hart. Pattern Classification and Scene Analysis. Wiley, 1973.
R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. WileyInterscience, New York, 1973.
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.
P. Frankl and H. Maehara. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. Journal of Combinatorial Theory B, 44:355–362, 1988.
A. Gersho and R. M. Gray. Vector Quantization and Signal Compression. Kluwer Academic Press, 1991.
L. Heinrich-Litan. PhD thesis, FU Berlin, in preparation.
P. Indyk. Dimensionality reduction techniques for proximity problems. In Proceedings, ACM Symposium on Data Structures and Algorithms, SODA 2000, pages 371–378, 2000.
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.
W. Johnson and G. Schechtman. Embedding ∓ m p into ∓ n 1 . Acta Mathematica, 149:71–85, 1985.
D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal on Computing, 12:28–35, 1983.
R. Klein. Algorithmische Geometrie. Addison-Wesley, Bonn, 1997.
J. Kleinberg. Two algorithms for nearest-neighbor search in high dimension. In Proc. 29th Annu. ACM Sympos. Theory Comput., pages 599–608, 1997.
D. Knuth. The art of computer programming. Addison-Wesley, 1973.
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.
N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215–245, 1995.
S. Meiser. Point location in arrangements of hyperplanes. Inform. Comput., 106:286–303, 1993.
M. Minsky and S. Papert. Perceptrons. MIT Press, Cambridge MA, 1969.
A. Okabe, B. Boots, and K. Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester, UK, 1992.
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.
C. J. van Rijsbergen. Information Retrieval. Butterworths, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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