C1 W4 quiz, question 10

I do not understand how a hash table can a​llow us to divide vector space to regions. The hash table is a general data structure, isn’t? It has nothing to do with vector spaces or regions.

Hello @larryleguo!

If you remember from the classes, we can have what we call a “Locality sensitive hashing”, which is a technique that allows you to hash similar inputs into the same buckets with high probability. With it, you can clustering the points (or vectors) by deciding whether they are above or below a line, or a plane, or a region.

If you don’t remember, see this reading again.

Best regards,
Wesley P.

But the question is: “H​ash tables are useful because”. It does not mention any context about locality sensitive hashing.