aiscool

Port of this python code in Javascript.

LSH from Wikipedia:

Locality-sensitive hashing (LSH) reduces the dimensionality of high-dimensional data. LSH hashes input items so that similar items map to the same “buckets” with high probability (the number of buckets being much smaller than the universe of possible input items). LSH differs from conventional and cryptographic hash functions because it aims to maximize the probability of a “collision” for similar items. Locality-sensitive hashing has much in common with data clustering and nearest neighbor search.

More explanation:

• http://stackoverflow.com/questions/12952729/how-to-understand-locality-sensitive-hashing (Great simple explanation)
• https://en.wikipedia.org/wiki/Locality-sensitive_hashing
• http://infolab.stanford.edu/~ullman/mmds/ch3a.pdf