[mlpack-svn] r14120 - mlpack/trunk/src/mlpack/methods/neighbor_search
fastlab-svn at coffeetalk-1.cc.gatech.edu
fastlab-svn at coffeetalk-1.cc.gatech.edu
Tue Jan 15 14:16:10 EST 2013
Author: rcurtin
Date: 2013-01-15 14:16:10 -0500 (Tue, 15 Jan 2013)
New Revision: 14120
Modified:
mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp
Log:
It turns out we can actually make the bound a little tighter, which I
accidentally showed yesterday.
Modified: mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp
===================================================================
--- mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp 2013-01-15 18:58:36 UTC (rev 14119)
+++ mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp 2013-01-15 19:16:10 UTC (rev 14120)
@@ -212,8 +212,7 @@
{
// The bound for this point is the k-th best distance plus the maximum
// distance to a child of this node.
- const double bound = distances(distances.n_rows - 1, queryNode.Point(i)) +
- maxDescendantDistance;
+ const double bound = distances(distances.n_rows - 1, queryNode.Point(i));
if (SortPolicy::IsBetter(pointBound, bound))
pointBound = bound;
}
More information about the mlpack-svn
mailing list