A fast branch & bound nearest neighbour classifier in metric spaces
- 1 June 1996
- journal article
- Published by Elsevier BV in Pattern Recognition Letters
- Vol. 17 (7), 731-739
- https://doi.org/10.1016/0167-8655(96)00032-3
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirementsPattern Recognition Letters, 1994
- New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA)Pattern Recognition Letters, 1994
- New techniques for best-match retrievalACM Transactions on Information Systems, 1990
- An algorithm for finding nearest neighbours in (approximately) constant average timePattern Recognition Letters, 1986
- A Data Structure and an Algorithm for the Nearest Point ProblemIEEE Transactions on Software Engineering, 1983
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- A Branch and Bound Algorithm for Computing k-Nearest NeighborsIEEE Transactions on Computers, 1975