Hi Joel,
I was on vacation during past 3 days. I''ll look into this asap and let you
all know.
I also did some profiling, but only with the usage of `pairwise_distance`
method. Brute force technique directly uses that for the entire query
array, but LSH uses that in a loop and I noticed there is a
@Maheshakya, will you be able to do work in the near future on speeding up
the ascending phase instead? Or should another contributor take that baton?
Not only does it seem to be a major contributor to runtime, but it is
independent of metric and hashing mechanism (within binary hashes), and
hence
Hi Andreas,
Thank you for your reply!
The NFL belongs in the k-NN family of algorithms for classification /
regression.
In general, for a query point, NFL works like k-NN but instead of using the
k feature
points to determine the results, it generalized any two feature points of
the same class
by
