JoshEngels / FLINNGLinks
A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
☆23Updated 2 years ago
Alternatives and similar repositories for FLINNG
Users that are interested in FLINNG are comparing it to the libraries listed below
Sorting:
- Extremely simple and fast extreme multi-class and multi-label classifiers.☆70Updated last month
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago
- PyTorch Flexible Hash Embeddings☆28Updated 5 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 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
- A study of the downstream instability of word embeddings☆12Updated 3 years ago
- ☆15Updated 3 years ago
- Python bindings to Succinct Data Structure Library 2.0☆34Updated 6 years ago
- Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.☆18Updated 9 years ago
- Accurate and Fast ALSH for Maximum Inner Product Search (KDD 2018)☆26Updated 4 years ago
- Accelerated Confergence for Counterfactual Learning to Rank☆17Updated 3 years ago
- Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.☆33Updated last month
- Python implementation of projection losses.☆27Updated 6 years ago
- Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. "Efficient Inverted Indexes for Approximate Retrieva…☆101Updated 2 months ago
- Randomized SVD of large sparse matrices on Spark☆77Updated 3 years ago
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆61Updated last year
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆59Updated 5 years ago
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆39Updated this week
- maximum inner product tree☆26Updated 12 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
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆39Updated 7 years ago
- Implementation of many similarity join algorithms.☆15Updated 11 years ago
- Clustering for arbitrary data and dissimilarity function☆99Updated last year
- Source code for our paper "Joint Policy-Value Learning for Recommendation" published at KDD 2020.☆23Updated 2 years ago
- MISSION: Ultra Large-Scale Feature Selection using Count-Sketches☆13Updated 6 years ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 7 years ago
- ☆18Updated 2 years ago
- Estimators to perform off-policy evaluation☆13Updated last year
- Efficiency/Effectiveness Trade-offs in Learning to Rank☆12Updated 7 years ago