A Review of Fast Techniques for Nearest Neighbour Searching
Fionn D. Murtagh · 1984
The nearest neighbour or closest point problem is of importance in many areas. Recent research in hierarchical clustering has shown how efficient algorithms for this problem may be incorporated into the clustering algorithms, leading to a more efficient implementation of the latter. In this review, a wide range of nearest neighbour searching algorithms are briefly described, and their chief properties for use in clustering algorithms appraised.