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

[se4u]

Hi, I am a graduate student at JHU and I came across the paper "Maximum Inner-Product Search using Tree Data-structures", by Parikshit Ram and Alexander Gray while reading "Speeding Up the Xbox Recommender System..." by Pacquet et. al. who cite it as being a good algorithm for doing NN queries over high dimensional sparse data. According to the paper by Parikshit the cone-tree based NN search should be in MLPACK but I couldn't find it in the source or documentation. I just wanted to know if there was a stable release of the code of that paper in some other branch or repo somewhere ? 

Thanks.

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