Hi all, Is it possible to return the number of comparisons made by, say, ball trees (a nearest neighbor object) when searching for the closest query ?
Scikit Ball trees are implemented in Cython so it might require some work to add a counter to the ball tree code and re-compiling the file. So I am wondering if there is a method on the nearest neighbor object that I could call that would give me the number of comparisons. If not, wouldn't it be interesting to have such method added in a future release ? This is because ball trees is a branch and bound alg. and have a time complexity of approximately O(dlogn) but the complexity could become O(dn) if nothing is pruned. So it would be interesting to empirically observe how likely it is to have that worst case complexity. Cheers! --Issam ------------------------------------------------------------------------------ Dive into the World of Parallel Programming The Go Parallel Website, sponsored by Intel and developed in partnership with Slashdot Media, is your hub for all things parallel software development, from weekly thought leadership blogs to news, videos, case studies, tutorials and more. Take a look and join the conversation now. http://goparallel.sourceforge.net/ _______________________________________________ Scikit-learn-general mailing list Scikit-learn-general@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/scikit-learn-general
