Engineering a Simplified 0-Bit Consistent Weighted Sampling

Author/Creator ORCID





Citation of Original Publication

Edward Raff, Jared Sylvester, Charles Nicholas , Engineering a Simplified 0-Bit Consistent Weighted Sampling, In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. (2018) 1203-1212, DOI: 10.1145/3269206.3271690


This item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.


The Min-Hashing approach to sketching has become an important tool in data analysis, information retrial, and classification. To apply it to real-valued datasets, the ICWS algorithm has become a seminal approach that is widely used, and provides state-of-the-art performance for this problem space. However, ICWS suffers a computational burden as the sketch size K increases. We develop a new Simplified approach to the ICWS algorithm, that enables us to obtain over 20x speedups compared to the standard algorithm. The veracity of our approach is demonstrated empirically on multiple datasets and scenarios, showing that our new Simplified CWS obtains the same quality of results while being an order of magnitude faster.