dmllr / fast-lopq
Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximate nearest neighbor search of high dimensional data.
☆34Updated 4 years ago
Alternatives and similar repositories for fast-lopq:
Users that are interested in fast-lopq are comparing it to the libraries listed below
- PQ Fast Scan☆60Updated 5 years ago
- Fast search algorithm for product-quantized codes via hash-tables☆53Updated 6 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 9 years ago
- Implementation of HNSW that supports online updates☆64Updated 7 years ago
- QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS☆60Updated 6 years ago
- LSH-GPU ANN package☆93Updated 5 years ago
- High Dimensional Approximate Near(est) Neighbor☆33Updated 7 years ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 6 years ago
- TSDG: An efficient index graph for graph-based nearest neighbor search☆9Updated 2 years ago
- Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning☆21Updated 5 years ago
- Research code implementing inverted multiindex structure☆82Updated 11 years ago
- Kmeans Quantization + Random Projection based Locality Sensitive Hashing☆27Updated 5 years ago
- Source code for learning and evaluation different quantzation methods☆26Updated 9 years ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 5 years ago
- GPU-based large scale Approx. Nearest Neighbor Search, accepted at CVPR 2016☆91Updated 6 years ago
- Multi-index hashing for the resolution of ANN search problem on large datasets☆15Updated 6 years ago
- an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework☆93Updated 5 years ago
- Quick ADC☆25Updated 5 years ago
- 为HSNW源码加上了详细的注释☆19Updated 2 years ago
- Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors☆205Updated 4 years ago
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆58Updated 7 months ago
- Benchmarking approximate nearest neighbors. Note: This is an archived version from our SISAP 2017 paper, see below.☆27Updated 6 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated this week
- A framework for index based similarity search.☆19Updated 5 years ago
- A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF☆16Updated last year
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆50Updated 4 years ago
- Benchmark of Nearest Neighbor Search on High Dimensional Data☆207Updated 3 years ago
- fast library for ANN search and KNN graph construction☆288Updated 7 years ago
- Implementation of vector quantization algorithms, codes for Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner P…☆59Updated 4 years ago
- State-of-the-art method for large-scale ANN search as of Oct 2016. Presented at ECCV 16.☆74Updated 6 years ago