An algorithm for finding nearest neighbours in (approximately) constant average time
- 1 July 1986
- journal article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 4 (3) , 145-157
- https://doi.org/10.1016/0167-8655(86)90013-9
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
- A Metric for Comparing Relational DescriptionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A distance measure between attributed relational graphs for pattern recognitionIEEE Transactions on Systems, Man, and Cybernetics, 1983
- The nearest neighbor problem in an abstract metric spacePattern Recognition Letters, 1982
- Isolated and Connected Word Recognition--Theory and Selected ApplicationsIEEE Transactions on Communications, 1981
- An Algorithm for Finding Nearest NeighborsIEEE Transactions on Computers, 1975
- A Branch and Bound Algorithm for Computing k-Nearest NeighborsIEEE Transactions on Computers, 1975