메뉴 건너뛰기




Volumn , Issue , 2009, Pages 155-162

Brute force and indexed approaches to pairwise document similarity comparisons with MapReduce

Author keywords

Distributed algorithms; Hadoop

Indexed keywords

AD HOC RETRIEVAL; BRUTE FORCE; BRUTE FORCE ALGORITHMS; CARTESIAN PRODUCTS; DISTRIBUTED ALGORITHM; DOCUMENT COLLECTION; DOCUMENT SIMILARITY; EFFICIENCY GAIN; LIFE-SCIENCES;

EID: 71749087578     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1571941.1571970     Document Type: Conference Paper
Times cited : (81)

References (15)
  • 1
    • 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. CACM, 51(1):117-122, 2008.
    • (2008) CACM , vol.51 , Issue.1 , pp. 117-122
    • Andoni, A.1    Indyk, P.2
  • 2
    • 0034785332 scopus 로고    scopus 로고
    • Vector-space ranking with effective early termination
    • V. Anh, O. de Kretser, and A. Moffat. Vector-space ranking with effective early termination. In SIGIR, 35-42, 2001.
    • (2001) SIGIR , vol.35-42
    • Anh, V.1    de Kretser, O.2    Moffat, A.3
  • 3
    • 35348849154 scopus 로고    scopus 로고
    • Scaling up all pairs similarity search
    • R. Bayardo, Y. Ma, and R. Srikant. Scaling up all pairs similarity search. In WWW, 131-140, 2007.
    • (2007) , vol.131-140
    • Bayardo, R.1    Ma, Y.2    Srikant, R.3
  • 4
    • 85030321143 scopus 로고    scopus 로고
    • MapReduce: Simplified data processing on large clusters
    • J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI, 137-150, 2004.
    • (2004) OSDI , vol.137-150
    • Dean, J.1    Ghemawat, S.2
  • 5
    • 84859921422 scopus 로고    scopus 로고
    • Pairwise document similarity in large collections with MapReduce
    • T. Elsayed, J. Lin, and D. Oard. Pairwise document similarity in large collections with MapReduce. In ACL, Companion Volume, 265-268, 2008.
    • (2008) ACL, Companion , vol.265-268
    • Elsayed, T.1    Lin, J.2    Oard, D.3
  • 8
    • 33744789180 scopus 로고    scopus 로고
    • Space-limited ranked query evaluation using adaptive pruning
    • N. Lester, A. Moffat, W. Webber, and J. Zobel. Space-limited ranked query evaluation using adaptive pruning. In WISE, 470-477, 2005.
    • (2005) WISE , vol.470-477
    • Lester, N.1    Moffat, A.2    Webber, W.3    Zobel, J.4
  • 9
    • 57349179932 scopus 로고    scopus 로고
    • How do users find things with PubMed? Towards automatic utility evaluation with user simulations
    • J. Lin and M. Smucker. How do users find things with PubMed? Towards automatic utility evaluation with user simulations. In SIGIR, 19-26, 2008.
    • (2008) SIGIR , vol.19-26
    • Lin, J.1    Smucker, M.2
  • 10
    • 38549166666 scopus 로고    scopus 로고
    • PubMed related articles: A probabilistic topic-based model for content similarity
    • J. Lin and W. J. Wilbur. PubMed related articles: A probabilistic topic-based model for content similarity. BMC Bioinformatics, 8:423, 2007.
    • (2007) BMC Bioinformatics , vol.8 , pp. 423
    • Lin, J.1    Wilbur, W.J.2
  • 11
    • 0030260359 scopus 로고    scopus 로고
    • Self-indexing inverted files for fast text retrieval
    • A. Moffat and J. Zobel. Self-indexing inverted files for fast text retrieval. ACM TOIS, 14(4):349-379, 1996.
    • (1996) ACM TOIS , vol.14 , Issue.4 , pp. 349-379
    • Moffat, A.1    Zobel, J.2
  • 12
    • 0030270397 scopus 로고    scopus 로고
    • Filtered document retrieval with frequency-sorted indexes
    • M. Persin, J. Zobel, and R. Sacks-Davis. Filtered document retrieval with frequency-sorted indexes. JASIS, 47(10):749-764, 1996.
    • (1996) JASIS , vol.47 , Issue.10 , pp. 749-764
    • Persin, M.1    Zobel, J.2    Sacks-Davis, R.3
  • 13
    • 36448975208 scopus 로고    scopus 로고
    • Efficient document retrieval in main memory
    • T. Strohman and W. Croft. Efficient document retrieval in main memory. In SIGIR, 175-182, 2007.
    • (2007) SIGIR , vol.175-182
    • Strohman, T.1    Croft, W.2
  • 15
    • 0034788435 scopus 로고    scopus 로고
    • A study of smoothing methods for language models applied to ad hoc information retrieval
    • C. Zhai and J. Lafferty. A study of smoothing methods for language models applied to ad hoc information retrieval. In SIGIR, 334-342, 2001.
    • (2001) SIGIR , vol.334-342
    • Zhai, C.1    Lafferty, J.2


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