메뉴 건너뛰기




Volumn , Issue , 2011, Pages 4929-4932

Frequency based Locality Sensitive Hashing

Author keywords

Information retrieval; LSH; Similarity search

Indexed keywords

APPROXIMATE NEAREST NEIGHBOR; FREQUENCY THRESHOLD; HASH TABLE; HIGH DIMENSIONAL SPACES; LOCALITY SENSITIVE HASHING; LSH; MASSIVE DATA; NEAREST NEIGHBOR SEARCHES; ORDERS OF MAGNITUDE; P-STABLE; QUERY POINTS; SEARCH QUALITY; SIMILARITY SEARCH; TIME COST;

EID: 80052960443     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMT.2011.6002015     Document Type: Conference Paper
Times cited : (7)

References (9)
  • 1
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • Bentley and J. L. , "Multidimensional binary search trees used for associative searching," Communications of the ACM, vol. 18, no. 9, pp. 509-517, 1975.
    • (1975) Communications of the ACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.L.1
  • 2
    • 0038670812 scopus 로고    scopus 로고
    • Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
    • C. Böhm, S. Berchtold, and D. Keim, "Searching in high-dimensional spaces: index structures for improving the performance of multimedia databases," ACM Computing Surveys, vol. 33, no. 3, pp. 322-373, 2001.
    • (2001) ACM Computing Surveys , vol.33 , Issue.3 , pp. 322-373
    • Böhm, C.1    Berchtold, S.2    Keim, D.3
  • 3
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • P. Indyk and R. Motwani, "Approximate nearest neighbors: towards removing the curse of dimensionality," in Proc. of Symposium on Theory of Computing, 1998, pp. 604-613.
    • (1998) Proc. of Symposium on Theory of Computing , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 5
    • 37549058056 scopus 로고    scopus 로고
    • Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
    • A. Andoni and P. Indyk, "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions," Communications of the ACM, vol. 51, no. 1, 2008.
    • (2008) Communications of the ACM , vol.51 , Issue.1
    • Andoni, A.1    Indyk, P.2


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