[mlpack-git] master: Perform the top-level scoring too. (44fa159)

gitdub at big.cc.gt.atl.ga.us gitdub at big.cc.gt.atl.ga.us
Thu Mar 12 16:01:37 EDT 2015


Repository : https://github.com/mlpack/mlpack

On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/eddd7167d69b6c88b271ef2e51d1c20e13f1acd8...70342dd8e5c17e0c164cfb8189748671e9c0dd44

>---------------------------------------------------------------

commit 44fa15967722cc4121a661b080081cb2cbd216f6
Author: Ryan Curtin <ryan at ratml.org>
Date:   Mon Jan 12 17:07:14 2015 -0500

    Perform the top-level scoring too.


>---------------------------------------------------------------

44fa15967722cc4121a661b080081cb2cbd216f6
 .../binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp     | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/src/mlpack/core/tree/binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp b/src/mlpack/core/tree/binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp
index bd81df2..cc0fa13 100644
--- a/src/mlpack/core/tree/binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp
+++ b/src/mlpack/core/tree/binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp
@@ -52,6 +52,11 @@ BreadthFirstDualTreeTraverser<RuleType>::Traverse(
   typedef BinarySpaceTree<BoundType, StatisticType, MatType, SplitType>
       TreeType;
 
+  // Must score the root combination.
+  const double rootScore = rule.Score(queryRoot, referenceRoot);
+  if (rootScore == DBL_MAX)
+    return; // This probably means something is wrong.
+
   std::queue<TreeType*> queryList;
   std::queue<TreeType*> referenceList;
   std::queue<typename RuleType::TraversalInfoType> traversalInfos;



More information about the mlpack-git mailing list