ML Anthology

Improved Maximum Inner Product Search with Better Theoretical Guarantee Using Randomized Partition Trees

Omid Keivani, Kaushik Sinha, Parikshit Ram
MLJ 2018 pp. 1069-1094
doi:10.1007/S10994-018-5711-7 /mlj/2018/keivani2018mlj-improved/
PDF MLJ Semantic Scholar

Cite

Text

Keivani et al. "Improved Maximum Inner Product Search with Better Theoretical Guarantee Using Randomized Partition Trees." Machine Learning, 2018. doi:10.1007/S10994-018-5711-7

Markdown

[Keivani et al. "Improved Maximum Inner Product Search with Better Theoretical Guarantee Using Randomized Partition Trees." Machine Learning, 2018.](https://mlanthology.org/mlj/2018/keivani2018mlj-improved/) doi:10.1007/S10994-018-5711-7

BibTeX

@article{keivani2018mlj-improved,
  title     = {{Improved Maximum Inner Product Search with Better Theoretical Guarantee Using Randomized Partition Trees}},
  author    = {Keivani, Omid and Sinha, Kaushik and Ram, Parikshit},
  journal   = {Machine Learning},
  year      = {2018},
  pages     = {1069-1094},
  doi       = {10.1007/S10994-018-5711-7},
  volume    = {107},
  url       = {https://mlanthology.org/mlj/2018/keivani2018mlj-improved/}
}