A REVIEW OF FAST TECHNIQUES FOR NEAREST NEIGHBOUR SEARCHING
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.
Bibliographic Reference: COMPSTAT/6TH SYMPOSIUM ON COMPUTATIONAL STATISTICS, PRAHA (CZECHOSLOVAKIA), AUG. 27-31, 1984 WRITE TO CEC LUXEMBOURG, DG XIII/A2, POB 1907 MENTIONING PAPER E 31598 ORA
Availability: Can be ordered online
Record Number: 1989123007700 / Last updated on: 1987-01-01
Available languages: en