A fast algorithm for the nearest-neighbor classifier

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 19, Issue 3, 1997, Pages 277-281

  Djouadi, Abdelhamid ^a,b   Bouktache, Essaid ^a,b  

^a NOKIA RESEARCH CENTER   (United States)

^b PURDUE UNIVERSITY CALUMET   (United States)

Author keywords

Classification performance; Fast algorithm; Feature partition; Nearest neighbor; Pattern recognition

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; FEATURE EXTRACTION; IMAGE SEGMENTATION;

FEATURE PARTITION; NEAREST NEIGHBOR CLASSIFIER;

PATTERN RECOGNITION;

EID: 0031099904     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.584107     Document Type: Article

References (9)

1. T.M. Cover and P.E. Hart, "Nearest Neighbor Pattern Classification," IEEE Trans. Inf. Theory, vol. 13, pp. 21-27, Jan. 1967.
2. P.E. Hart, "The Condensed Nearest Neighbor," IEEE Trans. Inf. Theory, vol. 14, pp. 515-516, May 1968.
3. Ritter et al., "An Algorithm for a Selective Nearest Neighbor Decision Rule," IEEE Trans. Inf. Theory, vol. 21, pp. 665-669, Nov. 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.