[mlpack-git] [mlpack/mlpack] Vantage point tree (#708)

[lozhnikov]

I think the change is valid. Unfortunately it is not possible to make balls even tighter since each ball of `HollowBallBound` always intersects a point. So, the volume of each bound depends only on the vantage point. I think the number of base cases is huge since outer balls cover a lot of empty space.

I think it is possible to make `HollowBallBound` tighter. I suggest to consider an intersection of `HollowBallBound` with the minimum bounding ball. I guess it is easy to compute `MinDistance` and `MaxDistance`. And I think that should reduce the volume of the bound significantly. How do you think?

---
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/708#issuecomment-235355505
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160726/fe62785a/attachment-0001.html>