[mlpack-git] [mlpack/mlpack] Universal B tree implementation (#746)

[Ryan Curtin]

I see what you mean about the problems of the UB tree, now that I have read the paper.  In essence the idea of mapping the space to addresses, and each address representing a subregion, means that if we have only two points that are adjacent in some dimension d, but the difference in the addresses is high, then the node enclosing both of those encloses a huge amount of empty space!  So, even if we do optimize this tree like crazy, I am not sure we will be able to produce something that is competitive with the kd-tree, at least for the task of nearest neighbor search.  Perhaps it will be more useful for something like range search or other tasks.

-- 
You are receiving this because you are subscribed to this thread.
Reply to this email directly or view it on GitHub:
https://github.com/mlpack/mlpack/pull/746#issuecomment-240561544
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160817/6a18dfe4/attachment-0001.html>