Searching Web Data using MinHash LSH

@inproceedings{Rao2016SearchingWD,
  title={Searching Web Data using MinHash LSH},
  author={B. Rao and Erkang Zhu},
  booktitle={SIGMOD '16},
  year={2016}
}
  • B. Rao, Erkang Zhu
  • Published in SIGMOD '16 2016
  • Computer Science
  • In this extended abstract, we explore the use of MinHash Locality Sensitive Hashing (MinHash LSH) to address the problem of indexing and searching Web data. We discuss a statistical tuning strategy of MinHash LSH, and experimentally evaluate the accuracy and performance, compared with inverted index. In addition, we describe an on-line demo for the index with real Web data. 
    7 Citations

    Figures, Tables, and Topics from this paper.

    PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search
    • 7
    • PDF
    PM-LSH
    • 1
    • PDF
    Fast Eclat Algorithms Based on Minwise Hashing for Large Scale Transactions
    • 1
    Locality-Sensitive Hashing for Earthquake Detection: A Case Study Scaling Data-Driven Science
    • 25
    • PDF
    Web-Scale Web Table to Knowledge Base Matching
    • 5
    • PDF
    Abstractive Snippet Generation

    References

    SHOWING 1-2 OF 2 REFERENCES
    A Large Public Corpus of Web Tables containing Time and Context Metadata
    • 76
    • Highly Influential
    • PDF
    Defense of Minhash over Simhash AISTATS, volume 33 of JMLR Proceedings
    • Defense of Minhash over Simhash AISTATS, volume 33 of JMLR Proceedings
    • 2014