The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—A fast algorithm that finds the nearest neighbor (<it>NN</it>) of an unknown sample from a design set of labeled samples is proposed. This algorithm requires a quite moderate preprocessing effort and a rather excessive storage, but it accomplishes substantial computational savings during classification. The performance of the algorithm is described and compared to the performance of the conventional one. Results on simulated data are provided to illustrate the computational savings that may be achieved using this fast algorithm.</p>
Nearest neighbor, pattern recognition, feature partition, fast algorithm, classification performance.

A. Djouadi and E. Bouktache, "A Fast Algorithm for the Nearest-Neighbor Classifier," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 19, no. , pp. 277-282, 1997.
87 ms
(Ver 3.3 (11022016))