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

[Ryan Curtin]

Hi there,

The exact MIPS algorithm with the cone tree actually isn't in mlpack, so the paper is incorrect.  However, I bet Parikshit has an implementation somewhere, which could be polished and added to mlpack (you can email him: p.ram at gatech.edu; whatever code he gives you, I can help you make it compile and work, and possibly just adapt and add it to mlpack so the paper is correct).

On the other hand, what we do have implemented is FastMKS, which solves inner-product search in a more general sense (http://ratml.org/pub/pdf/2014fastmks.pdf).  Here's a tutorial on how to use it in mlpack: http://mlpack.org/doxygen.php?doc=fmkstutorial.html . Perhaps that would be useful to you too?  I don't know how it will perform for nearest neighbor---our FastMKS implementation doesn't (currently) use cone trees.

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