One Permutation Hashing

  title={One Permutation Hashing},
  author={Ping Li and Art B. Owen and Cun-Hui Zhang},
The query complexity of locality sensitive hashing (LSH) based similarity search is dominated by the number of hash evaluations, and this number grows with the data size (Indyk & Motwani, 1998). In industrial applications such as search where the data are often high-dimensional and binary (e.g., text n-grams), minwise hashing is widely adopted, which requires applying a large number of permutations on the data. This is costly in computation and energy-consumption. In this paper, we propose a… CONTINUE READING
Highly Cited
This paper has 63 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 42 extracted citations

Large-Scale Linear NPSVM via One Permutation Hashing

2018 International Joint Conference on Neural Networks (IJCNN) • 2018
View 4 Excerpts
Highly Influenced

Probabilistic Hashing Techniques for Big Data

View 8 Excerpts
Highly Influenced

A Survey on Learning to Hash

IEEE Transactions on Pattern Analysis and Machine Intelligence • 2018
View 1 Excerpt
Highly Influenced

Fast Similarity Sketching

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) • 2017
View 3 Excerpts
Highly Influenced

Min-Max Hash for Jaccard Similarity

2013 IEEE 13th International Conference on Data Mining • 2013
View 4 Excerpts
Highly Influenced

$K$ -Ary Tree Hashing for Fast Graph Classification

IEEE Transactions on Knowledge and Data Engineering • 2018
View 1 Excerpt

64 Citations

Citations per Year
Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.

Similar Papers

Loading similar papers…