This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Fast Algorithm for the Nearest-Neighbor Classifier
March 1997 (vol. 19 no. 3)
pp. 277-282

Abstract—A fast algorithm that finds the nearest neighbor (NN) 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.

[1] T.M. Cover and P. Hart, "Nearest Neighbor Pattern Classification," Proc. IEEE Trans. Information Theory, pp. 21-27, 1967.
[2] P.E. Hart, “The Condensed Nearest Neighbor Rule,” IEEE Trans. Information Theory, vol. 14, no. 3, pp. 515-516, 1968.
[3] G.L. Ritter, H.B. Woodruff, and S.R. Lowry, “An Algorithm for a Selective Nearest Neighbor Decision Rule,” IEEE Trans. Information Theory, vol. 21, no. 6, pp. 665-669, 1975.
[4] C.L. Chang, "Finding Prototypes for Nearest Neighbor Classifiers," IEEE Trans. Computers, vol. 23, pp. 1,179-1,183, Nov. 1974.
[5] I.K. Sethi, "A Fast Algorithm for Recognizing Nearest Neighbors," IEEE Trans. Syst., Man, and Cyber., vol. 11, no. 3, pp. 245-249, Mar. 1981.
[6] K. Fukunaga and P.M. Narenda, "A Branch and Bound Algorithm for Computing K-Nearest Neighbors," IEEE Trans. Computers, vol. 24, pp. 1,000-1,006, Oct. 1975.
[7] Belur, "A Composite Classifier," Proc. IEEE, vol. 67, no. 5, pp. 708-713, May 1979.
[8] C. Vassaire and Pasteur, "A Fast Algorithm for Non Parametric Probability Density Estimation," IEEE Trans. Pattern Anal. Machine Intell., vol. 4,. no. 6, pp. 663-666, Nov. 1982.
[9] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis.New York, Wiley, 1973.

Index Terms:
Nearest neighbor, pattern recognition, feature partition, fast algorithm, classification performance.
Citation:
Abdelhamid Djouadi, Essaid Bouktache, "A Fast Algorithm for the Nearest-Neighbor Classifier," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 19, no. 3, pp. 277-282, March 1997, doi:10.1109/34.584107
Usage of this product signifies your acceptance of the Terms of Use.