JoshEngels / FLINNGLinks
A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
☆23Updated last year
Alternatives and similar repositories for FLINNG
Users that are interested in FLINNG are comparing it to the libraries listed below
Sorting:
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago
- Extremely simple and fast extreme multi-class and multi-label classifiers.☆70Updated 5 months ago
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆39Updated 7 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 6 months ago
- PyTorch Flexible Hash Embeddings☆28Updated 5 years ago
- High Dimensional Approximate Near(est) Neighbor☆33Updated 8 years ago
- fast kernel evaluation in high dimensions via hashing☆23Updated 4 years ago
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆58Updated last year
- Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.☆31Updated last month
- Kmeans Quantization + Random Projection based Locality Sensitive Hashing☆29Updated 6 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆54Updated 10 years ago
- maximum inner product tree☆26Updated 12 years ago
- C++ source code for the Dynamic Index algorithm proposed in "Efficient Similarity Computation for Collaborative Filtering in Dynamic Envi…☆16Updated 6 years ago
- Code for NeurIPS 2019 paper "Hierarchical Optimal Transport for Document Representation"☆54Updated 5 years ago
- Official repository of "Efficient and Effective Query Expansion for Web Search", Short Paper @ CIKM 2018☆15Updated 5 years ago
- Randomized SVD of large sparse matrices on Spark☆77Updated 3 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆56Updated 5 years ago
- locality sensitive hashing (LSHASH) for Python3☆71Updated 4 months ago
- Fast and memory-efficient ANN with a subset-search functionality☆154Updated 2 months ago
- Python bindings to Succinct Data Structure Library 2.0☆33Updated 6 years ago
- Clustering for arbitrary data and dissimilarity function☆96Updated last year
- A C++ library to benchmark inverted indexes.☆21Updated 5 years ago
- My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".☆52Updated 6 months ago
- Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. "Efficient Inverted Indexes for Approximate Retrieva…☆81Updated last week
- Implementation of vector quantization algorithms, codes for Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner P…☆59Updated 4 years ago
- Efficient and effective query auto-completion in C++.☆55Updated last year
- Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors☆213Updated 5 years ago
- A multi-threaded C++ implementation of Nickel & Kiela's "Poincare Embeddings" paper from NIPS 2017, following the implementation of the a…☆17Updated 7 years ago
- Simple implementation of CoveringLSH☆10Updated 9 years ago