atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Simple and Efficient Weighted Minwise Hashing

NeurIPS 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristic and local search algorithms · 33 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
rejection-sampling weighted minwise hashing (red-green map) replacing Ioffe's CWSweighted minwise hashing · Oxford, Caltech101, Hist (500 hashes)time to compute 500 hashes: up to ~60000x faster than Ioffe on Oxford/Caltech101Helped
rejection-sampling WMH replacing Fast-WDOPH biased approximationweighted minwise hashing · Caltech101, Oxford, Histtime to compute 500 hashes: roughly 5 to 100x fasterHelped
rejection-sampling WMH (proposed) vs Ioffe's exact CWSweighted minwise hashing · Sim=0.8 to 0.27 pairs, k=1..50Jaccard estimation errorNo clear effect
replace weighted-to-unweighted reduction (Fast-WDOPH) with exact unbiased samplingweighted minwise hashing · Jaccard estimation, 9 vector pairsestimation errorHelped
rejection sampling hash bit width instead of 32-64 bit hashesweighted minwise hashing · Hist, Caltech101, Oxfordbits needed per hash: 7-9 bits vs 32-64 bitsHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy