메뉴 건너뛰기




Volumn , Issue , 2013, Pages 359-368

Locality sensitive hashing for scalable structural classification and clustering of web documents

Author keywords

Locality sensitive hashing; Template detection; Template fingerprints

Indexed keywords

INFORMATION EXTRACTION TECHNIQUES; LOCALITY SENSITIVE HASH; LOCALITY SENSITIVE HASHING; OPEN DIRECTORY PROJECTS; STRUCTURAL CLASSIFICATION; TEMPLATE DETECTION; TEMPLATE FINGERPRINTS; WEB CONTENT MANAGEMENT SYSTEMS;

EID: 84889591088     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2505515.2505673     Document Type: Conference Paper
Times cited : (14)

References (20)
  • 11
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions and reversals
    • VI Levenshtein. Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady, 10:707-710, 1966.
    • (1966) Soviet Physics Doklady , vol.10 , pp. 707-710
    • Levenshtein, V.I.1
  • 13
    • 84950632109 scopus 로고
    • Objective criteria for the evaluation of clustering methods
    • William M. Rand. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66(336):846-850, 1971.
    • (1971) Journal of the American Statistical Association , vol.66 , Issue.336 , pp. 846-850
    • Rand, W.M.1
  • 20
    • 0021439618 scopus 로고
    • A technique for high-performance data compression
    • T. A. Welch. A technique for high-performance data compression. Computer, 17(6):8-19, 1984.
    • (1984) Computer , vol.17 , Issue.6 , pp. 8-19
    • Welch, T.A.1


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