A fast algorithm for finding k-nearest neighbors with non-metric dissimilarity

Proceedings - International Workshop on Frontiers in Handwriting Recognition, IWFHR

Volumn , Issue , 2002, Pages 13-18

  Zhang, Bin ^a   Srihari, Sargur N ^a  

^a State University of New York at Buffalo ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY FEATURES; DISSIMILARITY MEASURES; FAST ALGORITHMS; HANDWRITTEN DIGIT RECOGNITION; HIERARCHICAL SEARCH; K-NEAREST NEIGHBORS; NEAREST NEIGHBORS; NN ALGORITHMS;

ALGORITHMS;

EID: 84893505414     PISSN: 15505235     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWFHR.2002.1030877     Document Type: Conference Paper

References (8)

1. T. M. Cover and P. E. Hart, "Nearest neighbor pattern classification," IEEE Trans. Inform. Theory, vol. IT-13, pp. 21-27, Jan 1968.
2. P. E. Hart, "Condensed nearest neighbor rule," IEEE Trans. Inform. Theory, vol. IT-14, pp. 515-516, May 1968.
3. A. J. Broder, "Strategies for efficient incremental nearest neighbor search," Pattern Recognition, vol. 23, no. 1/2, pp. 171-178, Nov 1986.
4. J. H. Friedman, F. Baskett, and L. J. Shustek, "An algorithm for finding nearest neighbors," IEEE Trans. Computers, vol. C-24, no. 10, pp. 1000-1006, Oct 1975.
5. K. Funkunaga and P.M. Navendra, "A branch and bound algorithm for computing k-nearest neighbors," IEEE Trans. Computers, vol. C-24, no. 7, pp. 750-753, July 1975.
6. J. T. Favata and G. Srikantan, "A multiple feature/resolution approach to handprinted character/digit recognition," International Journal of Imaging Systems and Technology, vol. 7, pp. 304-311, 1996.
7. J.D. Tubbs, "A note on binary template matching," Pattern Recognition, vol. 22, no. 4, pp. 359-365, 1989.
8. S. Cha and S. N. Srihari, "A fast nearest neighbor search algorithm by filtration," Pattern Recognition, vol. 35, no. 2, pp. 515-525, Feb 2002.