Skip to main content

Nearest Neighbor

  • Reference work entry
  • First Online:
Encyclopedia of Machine Learning and Data Mining
  • 164 Accesses

Synonyms

Closest point; Most similar point

Definition

In a data collection M, the nearest neighbor to a data object q is the data object M i , which minimizes dist (q, M i ), where dist is a distance measure defined for the objects in question. Note that the fact that the object M i is the nearest neighbor to q does not imply that q is the nearest neighbor to M i .

Motivation and Background

Nearest neighbors are useful in many machine learning and data mining tasks, such as classification, anomaly detection and motif discovery and in more general tasks such as spell checking, vector quantization, plagiarism detection, web search, and recommender systems.

The naive method to find the nearest neighbor to a point q requires a linear scan of all objects in M. Since this may be unacceptably slow for large datasets and/or computationally demanding distance measures, there is a huge amount of literature on speeding up nearest neighbor searches (query-by-content). The fastest methods depend...

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 699.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.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

Recommended Reading

  • Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD international conference on management of data. ACM, New York, pp 47–57. ISBN: 0-89791-128-8

    Chapter  Google Scholar 

  • Manolopoulos Y, Nanopoulos A, Papadopoulos AN, Theodoridis Y (2005) R-trees: theory and applications. Springer, Berlin

    MATH  Google Scholar 

  • Zezula P, Amato G, Dohnal V, Batko M (2005) Similarity search: the metric space approach. In: Advances in database systems, vol 32. Springer, New York, p 220. ISBN:0-387-29146-6

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media New York

About this entry

Cite this entry

Keogh, E. (2017). Nearest Neighbor. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7687-1_579

Download citation

Publish with us

Policies and ethics