Random projection-based auxiliary information can improve tree-based nearest neighbor search

DOI10.1016/j.ins.2020.08.054zbMath1475.68103OpenAlexW3082824678MaRDI QIDQ2055550

Omid Keivani, Kaushik Sinha

Publication date: 1 December 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2020.08.054

zbMATH Keywords

auxiliary informationrandom projection treenearest neighbor searchpriority function

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Refinements to nearest-neighbor searching in k-dimensional trees
• Satisfying general proximity/similarity queries with metric trees
• Improved maximum inner product search with better theoretical guarantee using randomized partition trees
• When is `nearest neighbour' meaningful: A converse theorem and implications
• Randomized partition trees for nearest neighbor search
• Extensions of Lipschitz mappings into a Hilbert space
• Multidimensional binary search trees used for associative searching
• Locality-sensitive hashing scheme based on p-stable distributions

This page was built for publication: Random projection-based auxiliary information can improve tree-based nearest neighbor search