Practical Hash Functions for Similarity Estimation and Dimensionality Reduction

1 code implementation • NeurIPS 2017 • Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup

We find that mixed tabulation hashing is almost as fast as the multiply-mod-prime scheme ax+b mod p. Mutiply-mod-prime is guaranteed to work well on sufficiently random data, but we demonstrate that in the above applications, it can lead to bias and poor concentration on both real-world and synthetic data.

Dimensionality Reduction