You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi, I've been playing with the code and it's speed is very impressive. Most of the example employ real valued representations of the objects. Is the method applicable to a binary representation? In particular, I guess the similarity calculations should be appropriate for the representation (e.g., jaccard for binary data, euclidean for real valued data etc).
So I guess the question is, is it appropriate to run this on binary data?
The text was updated successfully, but these errors were encountered:
No distance metric apart from the Euclidean is currently supported. So you can run it on binary data, but only using Euclidean distances.
@linqiaozhi Annoy supports various metrics out of the box. Should we maybe have a metric parameter that simply gets passed on to Annoy? It should be trivial to implement. (One would want to switch off the normalization of the data for custom metrics.)
@linqiaozhi Annoy supports various metrics out of the box. Should we maybe have a metric parameter that simply gets passed on to Annoy? It should be trivial to implement. (One would want to switch off the normalization of the data for custom metrics.)
This is a great idea. And we can just give an error if the user tries to use VP trees with a non-Euclidean metric.
Hi, I've been playing with the code and it's speed is very impressive. Most of the example employ real valued representations of the objects. Is the method applicable to a binary representation? In particular, I guess the similarity calculations should be appropriate for the representation (e.g., jaccard for binary data, euclidean for real valued data etc).
So I guess the question is, is it appropriate to run this on binary data?
The text was updated successfully, but these errors were encountered: