brj0 / nndescentLinks
C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search
☆21Updated 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☆35Updated 3 months ago
- Graph Library for Approximate Similarity Search☆132Updated last month
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆19Updated 4 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…☆162Updated 2 weeks ago
- Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. "Efficient Inverted Indexes for Approximate Retrieva…☆84Updated this week
- Reducing Dimensionality method for Nearest Neighbor Search☆15Updated 4 years ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆56Updated 5 years ago
- Framework for evaluating ANNS algorithms on billion scale datasets.☆399Updated last month
- ☆75Updated 9 months ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 7 years ago
- ☆189Updated last week
- ☆12Updated last year
- This is a source code for LSH-APG (PVLDB 2023)☆31Updated last year
- ☆15Updated 3 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆56Updated 5 years ago
- Approximate Nearest Neighbor search using reduced-rank regression, with extremely fast queries, tiny memory usage, and rapid indexing on …☆47Updated this week
- Algorithms for approximate nearest neighbor search with window filters☆42Updated last year
- Fast and memory-efficient clustering + coreset construction, including fast distance kernels for Bregman and f-divergences.☆33Updated 2 years ago
- Vector Index Benchmark for Embeddings (VIBE) is an extensible benchmark for approximate nearest neighbor search methods, or vector index…☆22Updated last week
- HyperLogLogLog: Counting Distinct Elements With One Log More☆18Updated 3 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search☆36Updated 7 months ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Updated 4 years ago
- Fast and explainable clustering in Python☆119Updated 8 months ago
- Plugin that provides pairing functions to the Polars library☆13Updated 7 months ago
- Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors☆215Updated 5 years ago
- ⚡ Faster similarity search with PDX: A vertical data layout for vectors☆57Updated last month
- ☆15Updated last year
- The source code for PM-LSH (PVLDB 2020)☆12Updated 10 months ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago