brj0 / nndescent
C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search
☆22Updated 6 months ago
Alternatives and similar repositories for nndescent:
Users that are interested in nndescent are comparing it to the libraries listed below
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆68Updated 2 years ago
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆132Updated 2 weeks ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 2 weeks ago
- Graph Library for Approximate Similarity Search☆104Updated 9 months ago
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆11Updated last week
- ☆69Updated last month
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 6 years ago
- CUDA implementation of Hierarchical Navigable Small World Graph algorithm☆154Updated 3 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago
- ☆142Updated this week
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆18Updated 4 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆49Updated 4 years ago
- Framework for evaluating ANNS algorithms on billion scale datasets.☆364Updated this week
- Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++☆30Updated 7 years ago
- A Python package for hubness analysis and high-dimensional data mining☆44Updated 8 months ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 3 years ago
- GGNN: State of the Art Graph-based GPU Nearest Neighbor Search☆152Updated last week
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Implementation of HNSW that supports online updates☆63Updated 7 years ago
- Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning☆21Updated 5 years ago
- A framework for index based similarity search.☆19Updated 5 years ago
- ☆13Updated last year
- Two-stage routing with Optimized Guided search and Greedy algorithm☆10Updated last year
- A simple implementation of UMAP, TSNE and GDR across frameworks and libraries☆13Updated 2 months ago
- A locality-sensitive hashing library☆46Updated 11 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago
- Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)☆28Updated 3 years ago
- Reducing Dimensionality method for Nearest Neighbor Search☆14Updated 4 years ago
- QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS☆15Updated 5 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 9 years ago