[mlpack-git] [mlpack/mlpack] Vantage point tree (#708)
lozhnikov
notifications at github.com
Fri Jul 22 03:31:47 EDT 2016
> + if (rightScore != DBL_MAX)
> + {
> + // Restore the right traversal info.
> + rule.TraversalInfo() = traversalInfo;
> + Traverse(queryNode, *referenceNode.Right());
> + }
> + else
> + ++numPrunes;
> + }
> + }
> + }
> + else
> + {
> + // If the reference node contains a point we should calculate all
> + // base cases with this point.
> + if (referenceNode.IsFirstPointCentroid())
I think this is inefficient. Is it possible to implement the score algorithm for a reference point and a query node?
---
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/files/300882ac96e7a663e3e303ca0c45c14c6fafe1a6#r71837324
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160722/cb9d3091/attachment.html>
More information about the mlpack-git
mailing list