PUFFINN: parameterless and universally fast finding of nearest neighbors

DOI10.4230/LIPICS.ESA.2019.10MaRDI QIDQ5075744FDOQ5075744

Authors: Martin Aumüller, Tobias Christiani, Rasmus Pagh, Michael Vesterli 

Publication date: 11 May 2022

Full work available at URL: https://arxiv.org/abs/1906.12211

Recommendations

• Simple and fast nearest neighbor search
• Exact \(L_{\infty}\) nearest neighbor search in high dimensions
• A locality-sensitive hash for real vectors
• Parameter-free locality sensitive hashing for spherical range reporting
• scientific article; zbMATH DE number 1775450

zbMATH Keywords

nearest neighbor searchlocality-sensitive hashingadaptive similarity search

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• annoy
• Similarity estimation techniques from rounding algorithms
• Title not available (Why is that?)
• Multidimensional binary search trees used for associative searching
• Approximate nearest neighbor: towards removing the curse of dimensionality
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
• Efficient algorithms for substring near neighbor problem
• Large-scale similarity joins with guarantees (invited talk)

Uses Software

• word2vec
• E2LSH
• GloVe
• FALCONN
• GitHub
• annoy
• NMSLIB

This page was built for publication: PUFFINN: parameterless and universally fast finding of nearest neighbors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075744)