[mlpack-git] master: Force four-point leaves. This is generally faster than one point. More points are probably even better (to a point... hah) but that requires a large k. (9ffe06d)

[gitdub at big.cc.gt.atl.ga.us]

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

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

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

commit 9ffe06de422fb4ee300bafb454f4d6816bc281bd
Author: Ryan Curtin <ryan at ratml.org>
Date:   Mon Feb 2 21:47:32 2015 -0500

    Force four-point leaves. This is generally faster than one point. More points are probably even better (to a point... hah) but that requires a large k.


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

9ffe06de422fb4ee300bafb454f4d6816bc281bd
 src/mlpack/methods/kmeans/dtnn_kmeans_impl.hpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/mlpack/methods/kmeans/dtnn_kmeans_impl.hpp b/src/mlpack/methods/kmeans/dtnn_kmeans_impl.hpp
index e6747e5..1f48545 100644
--- a/src/mlpack/methods/kmeans/dtnn_kmeans_impl.hpp
+++ b/src/mlpack/methods/kmeans/dtnn_kmeans_impl.hpp
@@ -29,7 +29,7 @@ TreeType* BuildTree(
 {
   // This is a hack.  I know this will be BinarySpaceTree, so force a leaf size
   // of two.
-  return new TreeType(dataset, oldFromNew, 1);
+  return new TreeType(dataset, oldFromNew, 4);
 }
 
 //! Call the tree constructor that does not do mapping.