Approximative fast nearest-neighbour recognition

Authors:
L. Miclet;M. Dabouz
Affiliations:
École Nationale Supérieure des Télecommunications, 46 Rue Barrault, 75634 Paris 13, France;École Nationale Supérieure des Télecommunications, 46 Rue Barrault, 75634 Paris 13, France
Venue:
Pattern Recognition Letters
Year:
1983

Citing 4
Cited 2

An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)
A Branch and Bound Algorithm for Computing k-Nearest Neighbors

IEEE Transactions on Computers
An Algorithm for Finding Nearest Neighbors

IEEE Transactions on Computers
The condensed nearest neighbor rule (Corresp.)

IEEE Transactions on Information Theory

Cell algorithms with data inflation for non-parametric classification

Pattern Recognition Letters
Directed enumeration method in image recognition

Pattern Recognition

Quantified Score

Hi-index	0.10

Visualization

Abstract

We analyze (on pseudo-randomly generated data) the errors committed with a log(N) algorithm, attempting to recognize the nearest neighbour among N vectors. We propose improvements in O(log(N)), and present an example of application on speech data.