Improved maximum inner product search with better theoretical guarantee using randomized partition trees

DOI10.1007/S10994-018-5711-7zbMath1461.68217OpenAlexW2801922433MaRDI QIDQ1621880

Parikshit Ram, Kaushik Sinha, Omid Keivani

Publication date: 12 November 2018

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-018-5711-7

zbMATH Keywords

nearest neighbor searchlocality-sensitive hashingmaximum inner product searchrandom projection trees

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Improved maximum inner product search with better theoretical guarantee using randomized partition trees ⋮ Random projection-based auxiliary information can improve tree-based nearest neighbor search

Uses Software

• UCI-ml
• FLANN

Cites Work

• Unnamed Item
• Improved maximum inner product search with better theoretical guarantee using randomized partition trees
• Cutting-plane training of structural SVMs
• Randomized partition trees for nearest neighbor search
• Dual‐tree fast exact max‐kernel search
• Locality-sensitive hashing scheme based on p-stable distributions

This page was built for publication: Improved maximum inner product search with better theoretical guarantee using randomized partition trees