메뉴 건너뛰기




Volumn , Issue , 2007, Pages 2663-2669

Learning "forgiving" hash functions: Algorithms and large scale tests

Author keywords

[No Author keywords available]

Indexed keywords

HIGH DIMENSIONAL DATA; HIGH DIMENSIONAL SPACES; LARGE DATASETS; LARGE SCALE TESTS; POSITIVE EXAMPLES; REAL-WORLD TASK; SIMILARITY FUNCTIONS; VIDEO RETRIEVAL;

EID: 84880903348     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (6)

References (15)
  • 5
    • 84933530882 scopus 로고    scopus 로고
    • Approximating discrete probability distributions via dependence trees
    • C. Chow, C. Liu. Approximating discrete probability distributions via dependence trees. IEEE Trans. Info. Theory, vol. IT-14.
    • IEEE Trans. Info. Theory , vol.IT-14
    • Chow, C.1    Liu, C.2
  • 8
    • 84880891404 scopus 로고    scopus 로고
    • Discriminant Adaptive Nearest Neighbor
    • T. Hastie, R. Tibshirani. Discriminant Adaptive Nearest Neighbor, IEEE PAMI, vol. 18.
    • IEEE PAMI , vol.18
    • Hastie, T.1    Tibshirani, R.2
  • 15
    • 84880896095 scopus 로고    scopus 로고
    • Kernel Relevant Component Analysis for Distance Metric Learning
    • I. W. Tsang, P.-M. Cheung, J. T. Kwok. Kernel Relevant Component Analysis for Distance Metric Learning. IJCNN.
    • IJCNN
    • Tsang, I.W.1    Cheung, P.-M.2    Kwok, J.T.3


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