메뉴 건너뛰기




Volumn 2905, Issue , 2003, Pages 456-463

Some improvements in tree based nearest neighbour search algorithms

Author keywords

Elimination rule; Metric Spaces; Nearest Neighbour; Pattern Recognition

Indexed keywords

ALGORITHMS; PATTERN RECOGNITION; TREES (MATHEMATICS);

EID: 35248853468     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24586-5_56     Document Type: Article
Times cited : (5)

References (10)
  • 4
    • 0016533974 scopus 로고
    • A branch and bound algorithm for computing k-nearest neighbours
    • Fukunaga, K., Narendra, M.: A branch and bound algorithm for computing k-nearest neighbours. IEEE Trans. Computing (1975) 24 750-753
    • (1975) IEEE Trans. Computing , vol.24 , pp. 750-753
    • Fukunaga, K.1    Narendra, M.2
  • 5
    • 0020824191 scopus 로고
    • A data structure and an algorithm for the nearest point problem
    • Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Trans. Software Engineering (1983) 9 631-634
    • (1983) IEEE Trans. Software Engineering , vol.9 , pp. 631-634
    • Kalantari, I.1    McDonald, G.2
  • 6
    • 0021088487 scopus 로고
    • Approximate fast nearest-neighbour recognition
    • L. Miclet, M. Dabouz: Approximate fast nearest-neighbour recognition. Pattern Recognition Letters (1983) 1277-285.
    • (1983) Pattern Recognition Letters , vol.1 , pp. 277-285
    • Miclet, L.1    Dabouz, M.2
  • 7
    • 0030169250 scopus 로고    scopus 로고
    • A fast branch and bound nearest neighbour classifier in metric spaces
    • Micó, L., Oncina, J., Carrasco, R.C.: A fast branch and bound nearest neighbour classifier in metric spaces. Pattern Recognition Letters (1996) 17 731-739
    • (1996) Pattern Recognition Letters , vol.17 , pp. 731-739
    • Micó, L.1    Oncina, J.2    Carrasco, R.C.3
  • 8
    • 0010459993 scopus 로고
    • ROARS project ESPRIT II - Number 5516. Thomson Technical Report TS ASM 93/S/EGS/NC/079
    • Alinat, P.: Periodic progress report 4, ROARS project ESPRIT II - Number 5516. Thomson Technical Report TS ASM 93/S/EGS/NC/079 (1993)
    • (1993) Periodic Progress Report 4
    • Alinat, P.1
  • 9
    • 0347116141 scopus 로고    scopus 로고
    • A fast algorithm for a k-NN classifier based on branch and bound method and computational quantity estimation
    • S. Omachi, H. Aso: A fast algorithm for a k-NN classifier based on branch and bound method and computational quantity estimation. Systems and Computers in Japan, vol. 31, no 6, pp. 1-9 (2000).
    • (2000) Systems and Computers in Japan , vol.31 , Issue.6 , pp. 1-9
    • Omachi, S.1    Aso, H.2
  • 10
    • 0000835392 scopus 로고
    • Webb: OPUS: An Efficient Admissible Algorithm for Unordered Search
    • Geofrey I. Webb: OPUS: An Efficient Admissible Algorithm for Unordered Search. Journal of Artificial Intelligence Research 3 (1995) 431-465.
    • (1995) Journal of Artificial Intelligence Research , vol.3 , pp. 431-465
    • Geofrey, I.1


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