메뉴 건너뛰기




Volumn , Issue , 2002, Pages 13-18

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

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;

EID: 84893505414     PISSN: 15505235     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWFHR.2002.1030877     Document Type: Conference Paper
Times cited : (12)

References (8)
  • 1
    • 84926662675 scopus 로고
    • Nearest neighbor pattern classification
    • Jan
    • T. M. Cover and P. E. Hart, "Nearest neighbor pattern classification," IEEE Trans. Inform. Theory, vol. IT-13, pp. 21-27, Jan 1968.
    • (1968) IEEE Trans. Inform. Theory , vol.IT-13 , pp. 21-27
    • Cover, T.M.1    Hart, P.E.2
  • 2
    • 84931162639 scopus 로고
    • Condensed nearest neighbor rule
    • May
    • P. E. Hart, "Condensed nearest neighbor rule," IEEE Trans. Inform. Theory, vol. IT-14, pp. 515-516, May 1968.
    • (1968) IEEE Trans. Inform. Theory , vol.IT-14 , pp. 515-516
    • Hart, P.E.1
  • 3
    • 0025198785 scopus 로고
    • Strategies for efficient incremental nearest neighbor search
    • Nov
    • A. J. Broder, "Strategies for efficient incremental nearest neighbor search," Pattern Recognition, vol. 23, no. 1/2, pp. 171-178, Nov 1986.
    • (1986) Pattern Recognition , vol.23 , Issue.1-2 , pp. 171-178
    • Broder, A.J.1
  • 4
    • 0016567534 scopus 로고
    • An algorithm for finding nearest neighbors
    • Oct
    • 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.
    • (1975) IEEE Trans. Computers , vol.C-24 , Issue.10 , pp. 1000-1006
    • Friedman, J.H.1    Baskett, F.2    Shustek, L.J.3
  • 5
    • 0016533974 scopus 로고
    • A branch and bound algorithm for computing k-nearest neighbors
    • July
    • 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.
    • (1975) IEEE Trans. Computers , vol.C-24 , Issue.7 , pp. 750-753
    • Funkunaga, K.1    Navendra, P.M.2
  • 6
  • 7
    • 0024855525 scopus 로고
    • A note on binary template matching
    • J.D. Tubbs, "A note on binary template matching," Pattern Recognition, vol. 22, no. 4, pp. 359-365, 1989.
    • (1989) Pattern Recognition , vol.22 , Issue.4 , pp. 359-365
    • Tubbs, J.D.1
  • 8
    • 0036466950 scopus 로고    scopus 로고
    • A fast nearest neighbor search algorithm by filtration
    • Feb
    • 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.
    • (2002) Pattern Recognition , vol.35 , Issue.2 , pp. 515-525
    • Cha, S.1    Srihari, S.N.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.