[mlpack] Student looking to contribute to mlpack

Rohit Shinde rohit.shinde12194 at gmail.com
Mon Apr 13 13:28:42 EDT 2015


I am trying to implement a quadtree right now. What is the depth limit that
I should use? Also, should each node be able to store one element only?

On Mon, Apr 13, 2015 at 10:32 PM, Rohit Shinde <rohit.shinde12194 at gmail.com>
wrote:

> Hi,
>
> Why are all the files in the src/mlpack/core/trees folder .hpp files? Even
> the implementation of all the methods is defined in the .hpp files? Why is
> this so?
>
> On Sun, Apr 12, 2015 at 9:24 AM, Rohit Shinde <rohit.shinde12194 at gmail.com
> > wrote:
>
>> I am looking Ullman's papers and he has given the implementation of
>> metric trees. Do I just have to modify it to make it suitable for mlpack?
>>
>> Also, I was looking at octrees and quadtrees. They seem pretty simple. I
>> checked in the src/mlpack/core/tree folder and I could not find their
>> implementation (or at least a file with the name "octree" or "quadtree") so
>> I assume they're not implemented. Is it okay if I implement them? They are
>> pretty easy to understand and implementation should not be too difficult.
>>
>> Once I get this task done, I would approach metric trees. Is that okay?
>>
>> On Sun, Apr 12, 2015 at 6:41 AM, Rohit Shinde <
>> rohit.shinde12194 at gmail.com> wrote:
>>
>>> I'm not sure but I remember reading about octrees somewhere. I think
>>> someone did implement it as part of gsoc.
>>>
>>> Anyway I'll start with vp trees.
>>>
>>> Thanks :-)
>>>
>>> On 6:32AM, Sun 12-Apr-2015 Ryan Curtin <ryan at ratml.org> wrote:
>>>
>>>> On Sun, Apr 12, 2015 at 12:41:30AM +0000, Rohit Shinde wrote:
>>>> > No no! The original link which I pasted in an earlier mail. That's
>>>> what I
>>>> > was talking about. Your link works perfectly fine.
>>>>
>>>> I updated the link on the wiki page.  Sorry about that.
>>>>
>>>> > Which trees do you suggest I implement? There are random projection
>>>> > trees, Bregman trees, UB trees, R+ trees, Hilbert trees, X trees,
>>>> segment
>>>> > trees, interval trees and range trees. Which one do you suggest I
>>>> > implement?
>>>>
>>>> So, Andrew Wells implemented R+ trees and X trees for his GSoC 2014
>>>> project (found in src/mlpack/core/tree/rectangle_tree/).
>>>>
>>>> I'd actually suggest one you don't have on the list -- metric trees (or
>>>> "vantage point trees"):
>>>>
>>>> http://webhost2.cs.missouri.edu/~uhlmannj/MetricTree91.pdf
>>>> http://webhost2.cs.missouri.edu/~uhlmannj/ImplementGH.pdf
>>>>
>>>> Peter Yianilos also developed the same structure and published it about
>>>> a year later, as the "VP-tree" (vantage point tree):
>>>>
>>>> http://pnylab.com/pny/papers/vptree/vptree/
>>>>
>>>> Another example not on the list that might be a good place to start is
>>>> the quadtree (or octree).
>>>>
>>>> Ryan
>>>>
>>>> --
>>>> Ryan Curtin    | "Good Lord - I've heard about this - cat juggling!
>>>> ryan at ratml.org | Stop! Stop! Stop it!" - Navin R. Johnson
>>>>
>>>
>>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack/attachments/20150413/b3959f07/attachment.html>


More information about the mlpack mailing list