[mlpack-git] master: No need for non-functional @defn command. (3e452e0)
gitdub at big.cc.gt.atl.ga.us
gitdub at big.cc.gt.atl.ga.us
Mon Aug 17 09:19:43 EDT 2015
Repository : https://github.com/mlpack/mlpack
On branch : master
Link : https://github.com/mlpack/mlpack/compare/f10c2d7fdf8a9350883a2b34269f14a97fca5bd4...3e452e0697b862783efae7adf055b7aa48dc09fc
>---------------------------------------------------------------
commit 3e452e0697b862783efae7adf055b7aa48dc09fc
Author: Ryan Curtin <ryan at ratml.org>
Date: Mon Aug 17 09:19:31 2015 -0400
No need for non-functional @defn command.
>---------------------------------------------------------------
3e452e0697b862783efae7adf055b7aa48dc09fc
doc/policies/trees.hpp | 2 --
1 file changed, 2 deletions(-)
diff --git a/doc/policies/trees.hpp b/doc/policies/trees.hpp
index ebcfbd2..b8e0fd2 100644
--- a/doc/policies/trees.hpp
+++ b/doc/policies/trees.hpp
@@ -53,7 +53,6 @@ International Conference on Machine Learning (ICML '13), pp. 1435--1443, 2013.
The definition is:
- at defn
A \b space \b tree on a dataset \f$ S \in \mathcal{R}^{N \times d} \f$ is an
undirected, connected, acyclic, rooted simple graph with the following
properties:
@@ -69,7 +68,6 @@ of the tree.
- Each node corresponds to some subset of \f$\mathcal{R}^d\f$ that contains
each point in the node and also the subsets that correspond to each child of the
node.
- at enddefn
This is really a quite straightforward definition: a tree is hierarchical, and
each node corresponds to some region of the input space. Each node may have
More information about the mlpack-git
mailing list