Skip to main content
SpringerLink
Log in

Nearest Neighbor Query

  • Reference work entry
Encyclopedia of GIS

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Arya, S. Mount, D.M., Netanyahu, N.S., Silverman, R., and Wu, A.Y.: An optimal algorithm for approximate nearest neighbor in fixed dimensions. J. ACM 45(6), 891–923 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hu, H., and Lee, D.L.: Range nearest‐neighbor query. IEEE Trans. on Knowl. Data Eng. 18(1), 78–91 (2006)

    Article  MathSciNet  Google Scholar 

  3. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 71–79 (1995)

    Google Scholar 

  4. Fix E., Hodges, J.L.: Discriminatory analysis: non‐parametric discrimination: consistency properties, Report No. 4. USAF School of Aviation Medicine, Randoph Field (1951)

    Google Scholar 

  5. Fix E., Hodges, J.L.: Discriminatory analysis: non‐parametric discrimination: small sample performance, Report No. 11. USAF School of Aviation Medicine, Randolph Field (1952)

    Google Scholar 

  6. Lawler, E.L., Lenstra, J. K., Rinnooy Khan, A.H.G., Shmoys, D. B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, Chichester (1985)

    MATH  Google Scholar 

  7. Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6, 563–581 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  8. Sproull, R.: Refinements to nearest neighbor searching in K-dimensional trees. Algorithmica 6, 579–589 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  9. Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching. J. ACM 45(6), 891–923 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Samet, H.: The Design & Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA (1989)

    Google Scholar 

  11. Samet, H.: Applications of Spatial Data Structures, Computer Graphics, Image Processing and GIS, Addison-Wesley, Reading, MA (1990)

    Google Scholar 

  12. Hjaltason, G.R., Samet, H.: Distance browsing in spatial data-bases. ACM Transaction on Database. Syst. (TODS) 24(2), 265–318 (1999)

    Article  Google Scholar 

  13. Indyk, P., Motwani, R.: Approximate nearest neighbor: towards removing the curse of dimensionality. In: Proceedings of the Symposium on Theory of Computing, pp. 604–613 (1998)

    Google Scholar 

  14. Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.: Locality sensitive hashing scheme based on p-stable distributions. In: Proceedings of the ACM Symposium on Computational Geometry, pp. 253–262 (2004)

    Google Scholar 

  15. Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: Proceedings of the Symposium on Foundations of Computer Science, pp. 459–468 (2006)

    Google Scholar 

  16. Ooi, B.C., McDonell, K.J., Sacks-Davis, R.: Spatial kd-tree: An indexing mechanism for spatial databases. In: Proceedings of the IEEE COMPSAC Conference, Tokyo, pp. 433–438 (1987)

    Google Scholar 

  17. Guttman, A.: R-Trees: A dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 47–57 (1984)

    Google Scholar 

  18. Finkel, R.A., Bentley, J.L.: Quad trees: A data structure for retrieval on composite keys. Acta Informatica 4(1), 1–9 (1974)

    Article  MATH  Google Scholar 

  19. Berchtold, S., Bohm, C., Keim, D.A., Kriegel, H.: A cost model for nearest neighbor search in high‐dimensional data space. In: Proceedings of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Tucson, Arizona, pp. 78–86 (1997)

    Google Scholar 

  20. Cover, T.M., Hart, K.J.: Nearest Neighbor Pattern Classification. IEEE Transaction on Inf. Theory. 13(1), 21–27 (Jan, 1967)

    Article  MATH  Google Scholar 

  21. Karypis, G., Han, E.H., Kumar, V.: CHAMELEON: A hierarchical clustering algorithm using dynamic modeling. IEEE Comput. 32(8), 68–75, (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA

    Feng Chen & Chang-Tien Lu

Authors
  1. Feng Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chang-Tien Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    Shashi Shekhar (McKnight Distinguished University Professor) (McKnight Distinguished University Professor)

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

    Hui Xiong (Assistant Professor) (Assistant Professor)

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Chen, F., Lu, CT. (2008). Nearest Neighbor Query. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_865

Download citation

Publish with us

Policies and ethics

Search

Navigation