MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Applying Efficient Techniques for Finding Nearest Neighbours in GIS Applications

Download:
Download as a PDF | Download as a PS
by Mohammed Al-daoud, Stuart Roberts
ftp://ftp.scs.leeds.ac.uk/scs/doc/reports/1995/95_15.ps.Z
Add To MetaCart

Abstract:

Abstract: Current GIS applications typically involve very large data sets. In order to utilise this wealth of information, new tools capable of handling the increases in data must be developed. In this article, we discuss some methods to find nearest neighbours efficiently. The results show that the cell method offers significant increase in efficiency over other methods when used to cluster large data sets. 1

Citations

734 Some methods for classification and analysis of multivariate observations – MacQueen - 1967
692 Multidimensional binary search trees used for associative searching – Bentley - 1975
410 An algorithm for finding best matches in logarithmic expected time – Friedman, Bentley, et al. - 1977
93 Refinements to Nearest-Neighbor Searching in k-Dimensional Trees – Sproull - 1991
72 Optimal expected-time algorithms for closest-point problems – Bentley, Weide, et al. - 1980
51 An algorithm for finding nearest neighbors – Friedman, Baskett, et al. - 1975
50 Quad-tree: a data structure for retrieval on composite keys – Finkel, Bentley - 1974
19 S.: Multidimensional data clustering utilizing hybrid search strategies – Ismail, Kamel - 1989
12 Location-allocation for small computers – Goodchild, Noronha - 1983
10 Knowledge Classification and Organization – Armstrong - 1991
9 New methods for the initialisation of clusters – AL-DAOUD, ROBERTS - 1996
9 Cluster Analysis: An Application of Lagrangian Relaxation – Mulvey, Crowder - 1979
4 Location-Allocation Systems – Scott - 1970
1 Spatial Analysis and GIS – O'Kelly - 1994
View or Download | Add to My Collection | Correct Errors