[mlpack-git] [mlpack] Maximum Inner-Product Search using Tree Data-structures in MLPACK ? (#427)

[Ryan Curtin]

Sorry for the slow response; it took a little while to do some refactoring (90a9d93 to 81fe638).  Anyway, now you should be able to do FastMKS with sparse datasets (in the git master branch, at least).  You'll have to do a little bit of type wrangling to get it to work right, since it's through template parameters.  Take a look at the examples in `src/mlpack/tests/fastmks_test.cpp` to see how to use FastMKS with sparse datasets.  Anyway, I hope this is helpful -- if you have any problems, please feel free to ask for help!  :)

---
Reply to this email directly or view it on GitHub:
https://github.com/mlpack/mlpack/issues/427#issuecomment-89867646
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20150405/aa0679b3/attachment.html>