Locality-Sensitive Hashing: Taming the Curse of Dimensionality

Many problems in computing boil down to a deceptively simple question: given one thing, how do you find the thing most similar to it? Imagine, for example, that you want to find the person who is physically closest to you. The answer seems obvious when there are only a few people around. But what happens when we have to search through increasingly complex spaces?
source: en.isna.ir