An efficient branch-and-bound nearest neighbour classifier
- 1 February 1988
- journal article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 7 (2) , 67-72
- https://doi.org/10.1016/0167-8655(88)90120-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An improved branch and bound algorithm for computing k-nearest neighborsPattern Recognition Letters, 1985
- Two Modifications of CNNIEEE Transactions on Systems, Man, and Cybernetics, 1976
- An Algorithm for Finding Nearest NeighborsIEEE Transactions on Computers, 1975
- A Branch and Bound Algorithm for Computing k-Nearest NeighborsIEEE Transactions on Computers, 1975
- The reduced nearest neighbor rule (Corresp.)IEEE Transactions on Information Theory, 1972
- The condensed nearest neighbor rule (Corresp.)IEEE Transactions on Information Theory, 1968
- Nearest neighbor pattern classificationIEEE Transactions on Information Theory, 1967