apaam/mlpack
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Handle empty datasets.

Browse Source
This commit is contained in:
Ryan Curtin
2015-09-25 16:28:40 -04:00
parent 7bd9c956ee
commit fa45524053
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp
+4 -2
View File
@@ -586,7 +586,8 @@ void BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::
SplitType<BoundType<MetricType>, MatType>& splitter)
{
// We need to expand the bounds of this node properly.
bound |= dataset->cols(begin, begin + count - 1);
if (count > 0)
bound |= dataset->cols(begin, begin + count - 1);
// Calculate the furthest descendant distance.
furthestDescendantDistance = 0.5 * bound.Diameter();
@@ -643,7 +644,8 @@ SplitNode(std::vector<size_t>& oldFromNew,
{
// This should be a single function for Bound.
// We need to expand the bounds of this node properly.
bound |= dataset->cols(begin, begin + count - 1);
if (count > 0)
bound |= dataset->cols(begin, begin + count - 1);
// Calculate the furthest descendant distance.
furthestDescendantDistance = 0.5 * bound.Diameter();