[mlpack-svn] r17112 - mlpack/trunk/src/mlpack/methods/neighbor_search
fastlab-svn at coffeetalk-1.cc.gatech.edu
fastlab-svn at coffeetalk-1.cc.gatech.edu
Mon Aug 25 17:23:04 EDT 2014
Author: rcurtin
Date: Mon Aug 25 17:23:04 2014
New Revision: 17112
Log:
Display base cases and scores for single-tree mode.
Modified:
mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp
Modified: mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp
==============================================================================
--- mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp (original)
+++ mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp Mon Aug 25 17:23:04 2014
@@ -252,19 +252,21 @@
}
else if (singleMode)
{
-
// The search doesn't work if the root node is also a leaf node.
// if this is the case, it is suggested that you use the naive method.
assert(!(referenceTree->IsLeaf()));
-
+
// Create the traverser.
typename TreeType::template SingleTreeTraverser<RuleType> traverser(rules);
// Now have it traverse for each point.
for (size_t i = 0; i < querySet.n_cols; ++i)
traverser.Traverse(i, *referenceTree);
+
+ Log::Info << rules.Scores() << " node combinations were scored.\n";
+ Log::Info << rules.BaseCases() << " base cases were calculated.\n";
}
- else // Dual-tree recursion.referenceTree
+ else // Dual-tree recursion.
{
// Create the traverser.
typename TreeType::template DualTreeTraverser<RuleType> traverser(rules);
More information about the mlpack-svn
mailing list