brj0 / nndescentLinks
C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search
☆23Updated last year
Alternatives and similar repositories for nndescent
Users that are interested in nndescent are comparing it to the libraries listed below
Sorting:
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆43Updated this week
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆19Updated 5 years ago
- CUDA implementation of Hierarchical Navigable Small World Graph algorithm☆175Updated 4 years ago
- Graph Library for Approximate Similarity Search☆140Updated 5 months ago
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆181Updated last month
- Framework for evaluating ANNS algorithms on billion scale datasets.☆422Updated last month
- Vector Index Benchmark for Embeddings (VIBE) is an extensible benchmark for approximate nearest neighbor search methods, or vector index…☆35Updated last month
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆72Updated 9 months ago
- Approximate Nearest Neighbor search using reduced-rank regression, with extremely fast queries, tiny memory usage, and rapid indexing on …☆50Updated 2 months ago
- ☆79Updated last year
- This is a source code for LSH-APG (PVLDB 2023)☆33Updated last year
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆59Updated 5 years ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 7 years ago
- ☆207Updated this week
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Fast and memory-efficient clustering + coreset construction, including fast distance kernels for Bregman and f-divergences.☆34Updated 2 years ago
- Repository related to the Dynamic Exploration Graph and its previous iterations.☆28Updated 3 weeks ago
- Benchmark of Nearest Neighbor Search on High Dimensional Data☆212Updated 4 years ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆57Updated 5 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 10 months ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Updated 2 months ago
- This is the implementation of the Hierarquical Clustering-based Nearest Neighbor Graphs☆22Updated 6 years ago
- SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search☆39Updated 11 months ago
- Reducing Dimensionality method for Nearest Neighbor Search☆15Updated 5 years ago
- Algorithms for approximate nearest neighbor search with window filters☆45Updated 2 years ago
- Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)☆13Updated 4 years ago
- Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors☆220Updated 5 years ago
- A new query hardness measure for graph-based ANN indexes. Build unbiased workloads with this hardness to see the actual performance of yo…☆22Updated last year
- ☆13Updated 2 years ago
- Distance Computaion for Vector Databases☆10Updated 5 months ago