On Wed, Mar 15, 2017 at 04:30:56PM +0100, Marcus Edel wrote: > > I looked in core/tree directory > > (https://github.com/mlpack/mlpack/tree/master/src/mlpack/core/tree). There > > are > > some tree structures, but I can't see a good way to adapt them to HAM > > architecture - but even if there is, I think it still will be more > > convenient to > > implement the gist of my previous letter. The reason is that tree structures > > from core/tree are created with different problems in mind and maintain > > problem- > > specific information in them, which is definitely not going to help because > > it > > will hinder both execution and developer time. Maybe I was just unable to > > find > > the right tree structure - if so, give me a link to it, because (as you > > mentioned) having a ready and tested implementation is helpful. > > I agree I'll see if I have some time, to play with some ideas that uses the > existing tree structures and let you know what I find out. But as I said, I'm > not against implementing an own structure, on the other side, it would make > sense to reuse some code if it turns out to be good idea.
I think it would be useful for me to respond here since I'm quite familiar with the tree code, but give me a day or two to look into the HAM algorithm and then I can follow up with an idea of whether or not mlpack's existing tree structures could work here, and how they could work if they could. -- Ryan Curtin | "I am the luckiest man alive!" [email protected] | - General Borzov _______________________________________________ mlpack mailing list [email protected] http://knife.lugatgt.org/cgi-bin/mailman/listinfo/mlpack
