Data-independent methods employ random projections to construct hash functions without any consideration on data characteristics, like the locality sensitive hashing (LSH) algorithm (Datar et al., 2004).
data dependent hashing seeks to learn a hash function from the given training data in a supervised or an unsupervised way.