[mlpack] Fast k-centers Algorithm & Implementation

[Abhinav Agarwalla]

Hello

I am Abhinav Agarwalla, a sophomore majoring in Mathematics and Computing
from Indian Institute of Technology, Kharagpur. I am really interested in
doing the project entitled 'Fast k-centers Algorithm & Implementation'
duing GSoC 2015.

I went through a previous mail regarding few sources from where to start
reading about dual-trees. I have read a few of them involving euclidean
minimum spanning trees, the cover trees one's are still left. I have also
started looking into the mlpack implementation of the same, and was hoping
that there would be something that I could do, like a patch, example or a
documentation, to get a better understanding of the code. Is there
something I can do, in this regard ?


Cheers
Abhinav Agarwalla
Sophomore
Department of Mathematics
IIT Kharagpur
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack/attachments/20150301/ad1562da/attachment.html>