[mlpack-svn] [MLPACK] #244: Apply tree traverser abstractions to range search

[MLPACK Trac]

#244: Apply tree traverser abstractions to range search
-------------------------+--------------------------------------------------
 Reporter:  rcurtin      |        Owner:                                                  
     Type:  enhancement  |       Status:  new                                             
 Priority:  major        |    Milestone:  mlpack 1.0.3                                    
Component:  mlpack       |     Keywords:  range_search, range search, tree traversal, tree
 Blocking:               |   Blocked By:                                                  
-------------------------+--------------------------------------------------
 We need to rewrite range search to work on arbitrary trees, so we must
 retool RangeSearch to use the new tree traversers.  We will have to make a
 RangeSearchRules class which implements the following functions:

  * `double BaseCase(const size_t queryIndex, const size_t
 referenceIndex);`

  * `double Score(const size_t queryIndex, TreeType& referenceNode);`
  * `double Score(const size_t queryIndex, TreeType& referenceNode, const
 double baseCaseResult)`;
  * `double Rescore(const size_t queryIndex, TreeType& referenceNode, const
 double oldScore)`;

  * `double Score(TreeType& queryNode, TreeType& referenceNode);`
  * `double Score(TreeType& queryNode, TreeType& referenceNode, const
 double baseCaseResult);`
  * `double Rescore(TreeType& queryNode, TreeType& referenceNode, const
 double oldScore);`

  * `void UpdateAfterRecursion(TreeType& queryNode, TreeType&
 referenceNode);`

 See `NeighborSearchRules` for an example implementation.

-- 
Ticket URL: <http://trac.research.cc.gatech.edu/fastlab/ticket/244>
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.