An improved method for finding nearest neighbors
- 31 July 1993
- journal article
- Published by Elsevier BV in Pattern Recognition Letters
- Vol. 14 (7), 531-535
- https://doi.org/10.1016/0167-8655(93)90101-i
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An efficient branch-and-bound nearest neighbour classifierPattern Recognition Letters, 1988
- 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