메뉴 건너뛰기




Volumn 23, Issue 9, 2001, Pages 964-976

A fast nearest-neighbor algorithm based on a principal axis search tree

Author keywords

Closest point; Intrinsic dimension; Nearest neighbor; Post office problem; Principal components analysis; Vector quantization encoding

Indexed keywords

NEAREST NEIGHBOR ALGORITHM; POST OFFICE PROBLEM; PRINCIPAL AXIS TRESS; VECTOR QUANTIZATION ENCODING;

EID: 0035441284     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.955110     Document Type: Article
Times cited : (156)

References (24)
  • 9
    • 0003797247 scopus 로고    scopus 로고
    • Innovations in local modeling for time series prediction
    • PhD thesis, Stanford Univ.
    • (1999)
    • McNames, J.1


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