From 9ffe06de422fb4ee300bafb454f4d6816bc281bd Mon Sep 17 00:00:00 2001
From: Ryan Curtin <ryan@ratml.org>
Date: Mon, 2 Feb 2015 21:47:32 -0500
Subject: [PATCH] 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.

---
 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 e6747e5f98..1f4854504d 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.