[mlpack-git] [mlpack/mlpack] Approximate Neighbor Search for Dual tree algorithms. (#684)
Ryan Curtin
notifications at github.com
Tue Jun 21 18:52:30 EDT 2016
> @@ -355,7 +394,10 @@ void NSModel<SortPolicy>::Search(arma::mat&& querySet,
> if (randomBasis)
> querySet = q * querySet;
>
> - Log::Info << "Searching for " << k << " nearest neighbors with ";
> + Log::Info << "Searching for " << k;
> + if (Epsilon() != 0)
> + Log::Info << " approximate (e=" << Epsilon() << ")";
Ooh, I forgot to respond to this, sorry about that. Maybe a clearer way to put it now is something like "searching for K nearest neighbors with a maximum of Y% relative error"; what 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/684/files/07879a2cc79b35b10d7fae687d6e27ad90a9f2d7#r67967156
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160621/f16028a1/attachment.html>
More information about the mlpack-git
mailing list