twistedcubic / learn-to-hashLinks
Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
☆72Updated 4 years ago
Alternatives and similar repositories for learn-to-hash
Users that are interested in learn-to-hash are comparing it to the libraries listed below
Sorting:
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆58Updated 11 months ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 6 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 4 months ago
- Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning☆21Updated 5 years ago
- fast kernel evaluation in high dimensions via hashing☆23Updated 4 years ago
- Supplementary Code for Unsupervised Neural Quantization for Compressed-Domain Similarity Search☆36Updated 5 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆55Updated 5 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- Implementation of vector quantization algorithms, codes for Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner P…☆59Updated 4 years ago
- Benchmark of Nearest Neighbor Search on High Dimensional Data☆208Updated 4 years ago
- Fast search algorithm for product-quantized codes via hash-tables☆53Updated 7 years ago
- Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)☆29Updated 4 years ago
- Kmeans Quantization + Random Projection based Locality Sensitive Hashing☆28Updated 6 years ago
- an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework☆96Updated 5 years ago
- Search with a hash index☆33Updated 6 years ago
- Light-weight GPU kernel interface for graph operations☆15Updated 5 years ago
- QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS☆61Updated 6 years ago
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆30Updated 2 weeks ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago
- Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors☆212Updated 5 years ago
- A fast implementation of spectral clustering on GPU-CPU Platform☆32Updated 7 years ago
- Large Scale Search Index☆31Updated 2 years ago
- Large Scale Graphical Model☆24Updated 6 years ago
- PQ Fast Scan☆64Updated 6 years ago
- A framework for index based similarity search.☆19Updated 6 years ago
- Implementation of HNSW that supports online updates☆66Updated 7 years ago
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆19Updated 4 years ago
- Anchor-t-SNE for large-scale and high-dimension vector visualization☆55Updated 5 years ago
- Implements the frequent directions algorithm for approximating matrices in streams☆32Updated 7 years ago
- LSH Scheme based on Longest Circular Co-Substring (SIGMOD 2020)☆15Updated 4 years ago