[mlpack-svn] [MLPACK] #156: Further generalization of trees to include cover trees
MLPACK Trac
trac at coffeetalk-1.cc.gatech.edu
Fri Apr 27 15:55:40 EDT 2012
#156: Further generalization of trees to include cover trees
----------------------------------------------------------+-----------------
Reporter: rcurtin | Owner:
Type: wishlist | Status: new
Priority: major | Milestone: mlpack 1.0.2
Component: mlpack | Resolution:
Keywords: tree cover kd-tree generalization templates | Blocking:
Blocked By: |
----------------------------------------------------------+-----------------
Changes (by rcurtin):
* milestone: mlpack 1.1.0 => mlpack 1.0.2
Comment:
I took Pari's implementation (which was very similar to Bill's) and used
it to write a new implementation which is in
`src/mlpack/core/tree/cover_tree.hpp` and
`src/mlpack/core/tree/cover_tree_impl.hpp` in r12552 (tests in r12553).
Because this tree type can have multiple children, any classes that use a
BinarySearchTree have to be adapted in some way. Where before this was
written:
{{{
Recurse(tree.Left());
Recurse(tree.Right());
}}}
we really should now use something more like
{{{
for (size_t i = 0; i < tree.NumChildren(); ++i)
Recurse(tree.Child(i));
}}}
--
Ticket URL: <http://trac.research.cc.gatech.edu/fastlab/ticket/156#comment:2>
MLPACK <www.fast-lab.org>
MLPACK is an intuitive, fast, and scalable C++ machine learning library developed by the FASTLAB at Georgia Tech under Dr. Alex Gray.
More information about the mlpack-svn
mailing list