Timeline for Find similar vector by Locality Sensitive Hashing
Current License: CC BY-SA 3.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 22, 2013 at 23:35 | comment | added | sflee | What is the nice theoretical properties? Is that because the universal hash function can make an uniform distribution for the indices independently with the input keys? | |
Jul 21, 2013 at 17:29 | comment | added | D.W.♦ | @sflee, yes, that's correct. You can use any reasonable hash function for hashing the pair-of-coordinates; it doesn't need to be universal. (Theorists like universal hashes because they have nice theoretical properties, but in practice, you can use any good hash.) | |
Jul 21, 2013 at 14:03 | vote | accept | sflee | ||
Jul 21, 2013 at 14:02 | comment | added | sflee | Thank you very much. I have think about it and have a question. It seems that no matter my hash function is universal or not, I just need to divide my vectors and project them, then those similar vectors will hash in the same bin with the probability related with their similarity. Am I right? | |
Jul 19, 2013 at 20:53 | history | answered | D.W.♦ | CC BY-SA 3.0 |