Skip to main content
SpringerLink
Log in

Nearest Neighbor Problem

  • Reference work entry
  • First Online:
Encyclopedia of GIS

  • 574 Accesses

Synonyms

All-k-nearest neighbors; All-nearest-neighbors; akNN; Balanced box decomposition tree (spatial index); Nearest neighbor; Range query; Reverse-k-nearest-neighbors aNN; Reverse-Nearest-Neighbor-Problem; rkNN; rNN; Spatial network

Definition

Given a set of n points and a query point, q , the nearest-neighbor (NN) problem is concerned with finding the point closest to the query point. Figure 1 shows an example of the nearest neighbor problem. On the left side is a set of n = 10 points in a two-dimensional space with a query point, q . The right shows the problem solution, s.

Nearest Neighbor Problem, Fig. 1
figure 151 figure 151

An example of a nearest-neighbor problem domain and solution

Full size image

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

Access this chapter

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  • Arya S (1998) An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J ACM (JACM) 45:891-923

    Article  MathSciNet  MATH  Google Scholar 

  • Athitos V (2003) Approximate nearest neighbor retrievel using Euclidean embeddings. Approximate nearest neighbors methods for learning and vision, 13 Dec 2003

    Google Scholar 

  • Berchtold S, Keim DA, Kriegel H-P (1996) The X-tree: an index structure for high-dimensional data. In: Proceedings of the 22nd international conference on very large databases, Mumbai

    Google Scholar 

  • Beyer K, Goldstein J, Ramakrishnan R, Shaft U (1999) When is ‘Nearest Neighbor’ Meaningful? Lecture notes in computer science. Springer, New York

    Google Scholar 

  • Hautamaki V, Karkkainen I et al (2004) Outlier detection using k-nearest neighbor graph. In: Proceedings of the 17th international conference on pattern recognition, Cambridge, vol 3, 23–26 Aug 2004, pp 430–433

    Google Scholar 

  • Ku W-S, Haojun W et al (2006) ANNATO: adaptive nearest neighbor queries in travel time networks. In: 7th international conference on mobile data management, Nara, 10–12 May 2006, pp 50

    Google Scholar 

  • Painho M, Bacao F (2000) Using genetic algorithms in clustering problems. In: GeoComputation 2000

    Google Scholar 

  • Traveling Salesman Problem. History of the TSP, Jan 2005

    Google Scholar 

Recommended Reading

  • Abhinandan D, Gehrke J, et al (2004) Approximation techniques for spatial data. In: Proceedings of the 2004 ACM SIGMOD international conference on management of data. Paris. SESSION: Research sessions: spatial data, pp 695–706

    Google Scholar 

  • Chavez E, Figueroa K, et al: A fast algorithm for the all k nearest neighbors problem in general metric spaces

    Google Scholar 

  • Google. Google Maps (2006) Search on “gas stations” near the “metrodome”, 12 Oct 2006

    Google Scholar 

  • Levitin A (2003) Introduction to the design and analysis of algorithms. Addison Wesley, Boston

    Google Scholar 

  • The Algorithm Design Manual (1997) Nearest Neighbor Search, 2 Jun 1997

    Google Scholar 

  • Tunkelang D (2002) Making the nearest neighbor meaningful. In: SIAM workshop on clustering high dimensional data and its applications

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA

    D. J. O’Neil

Authors
  1. D. J. O’Neil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Minnesota, Minneapolis, MN, USA

    Shashi Shekhar

  2. Management Science and Information Systems Department, Rutgers Business School, Rutgers, The State University of New Jersey, Newark, NJ, USA

    Hui Xiong

  3. Department of Management Sciences, Tippie College of Business, University of Iowa, Iowa City, IA, USA

    Xun Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

O’Neil, D.J. (2017). Nearest Neighbor Problem. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_869

Download citation

Publish with us

Policies and ethics

Search

Navigation