Skip to main content

Nearest Neighbor

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

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