[mlpack-svn] [MLPACK] #243: Dual cover tree traverser is quite slow

MLPACK Trac trac at coffeetalk-1.cc.gatech.edu
Fri Nov 23 22:00:40 EST 2012


#243: Dual cover tree traverser is quite slow
------------------------------------------------------------+---------------
  Reporter:  rcurtin                                        |        Owner:  rcurtin     
      Type:  defect                                         |       Status:  accepted    
  Priority:  major                                          |    Milestone:  mlpack 1.0.4
 Component:  mlpack                                         |   Resolution:              
  Keywords:  cover tree, dualtreetraverser, neighborsearch  |     Blocking:              
Blocked By:                                                 |  
------------------------------------------------------------+---------------

Comment (by rcurtin):

 Using a jl-code constructed cover tree on test_data_3_1000.csv and k = 5,
 as before, we get these numbers for the number of distance evaluations in
 the dual tree traversal:

  * jl-constructed cover tree, jl dual-tree traversal: 83962 (as before)
  * jl-constructed cover tree, mlpack dual-tree traversal: 247537
  * mlpack-constructed cover tree, mlpack dual-tree traversal: 189628 (as
 before)

  * jl-constructed cover tree, mlpack single-tree traversal: 136398
  * mlpack-constructed cover tree, mlpack dual-tree traversal: 127838 (as
 before)

 Therefore the issue is not with the actual way we are creating cover
 trees, but instead we know that the bug must be in the actual dual-tree
 traversal.  The jl-to-mlpack cover tree converter is in `contrib/rcurtin
 /jl-to-mlpack_cover_tree/` for posterity.

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