is it bug in searching ? about annoy HOT 4 CLOSED

I looked at the code but I'm not sure if it's a bug... the heuristic n * roots.size() is very arbitrary though.

In your case I'm not surprised most of the trees aren't visited because you have so many trees per node. Annoy keeps a priority queue of the most promising nodes (initialized to the roots)

If n is much smaller than K I see why it doesn't visit all the trees though.

Either way the solution is probably to change the n * roots.size() to something that makes more sense. maybe max(_K, n) instead of n?

from annoy.

Also you really shouldn't need 500 trees for 2000 nodes. It should be enough to have 5-10 trees

from annoy.

Thanks erikbern! I agree with your quick suggestions by now ^_^
ps: 500 trees is just an example, i should calculate the probability before choosing the parameters.

from annoy.

See #80 – can now specify at query time now many nodes to inspect!

from annoy.