[mlpack-svn] [MLPACK] #301: unify constructors of dual-tree algorithms
MLPACK Trac
trac at coffeetalk-1.cc.gatech.edu
Thu Aug 15 14:53:54 EDT 2013
#301: unify constructors of dual-tree algorithms
-------------------------+--------------------------------------------------
Reporter: rcurtin | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: mlpack 1.0.7
Component: mlpack | Keywords: dual-tree algorithms, tree, constructor, kd-tree, cover tree
Blocking: | Blocked By:
-------------------------+--------------------------------------------------
Right now, the NeighborSearch constructor, the RangeSearch constructor,
and the RASearch constructor each take the 'leafSize' parameter, which is
specific to kd-trees. In addition, the actual constructor implementation
is specific to kd-trees in that it hangs onto mappings for the tree when
indices are reordered.
So, we must unify tree constructors so that we only need to pass the
dataset they are being built on, but also we need some kind of compile-
time tree trait that tells us if the tree will mix the ordering of the
dataset.
Then, we can have two overloads of constructors to build the trees, and we
can use that compile-time constant later to determine if we need to unmap.
--
Ticket URL: <http://trac.research.cc.gatech.edu/fastlab/ticket/301>
MLPACK <www.fast-lab.org>
MLPACK is an intuitive, fast, and scalable C++ machine learning library developed at Georgia Tech.
More information about the mlpack-svn
mailing list