Alternatives and similar repositories for FLINNG

Users that are interested in FLINNG are comparing it to the libraries listed below

• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• cemoody / flexi_hash_embedding
  PyTorch Flexible Hash Embeddings
  ☆28Updated 5 years ago
• mwydmuch / napkinXC
  Extremely simple and fast extreme multi-class and multi-label classifiers.
  ☆69Updated 4 months ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆73Updated 4 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆58Updated last year
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 7 years ago
• HazyResearch / anchor-stability
  A study of the downstream instability of word embeddings
  ☆12Updated 2 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• cuMF / culda_cgs
  Efficient LDA solution on GPUs.
  ☆24Updated 6 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 4 months ago
• matteodellamico / flexible-clustering
  Clustering for arbitrary data and dissimilarity function
  ☆96Updated last year
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆33Updated 6 years ago
• olivierjeunen / dynamicindex
  C++ source code for the Dynamic Index algorithm proposed in "Efficient Similarity Computation for Collaborative Filtering in Dynamic Envi…
  ☆16Updated 6 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 11 years ago
• rasmus-pagh / coveringLSH
  Simple implementation of CoveringLSH
  ☆10Updated 9 years ago
• ZJULearning / RPLSH
  Kmeans Quantization + Random Projection based Locality Sensitive Hashing
  ☆28Updated 6 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 5 years ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆56Updated 5 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆55Updated last year
• IBM / HOTT
  Code for NeurIPS 2019 paper "Hierarchical Optimal Transport for Document Representation"
  ☆54Updated 5 years ago
• HarrieO / OnlineLearningToRank
  ☆63Updated 4 years ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆34Updated last month
• xinyandai / product-quantization
  Implementation of vector quantization algorithms, codes for Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner P…
  ☆59Updated 4 years ago
• olivierjeunen / dual-bandit-kdd-2020
  Source code for our paper "Joint Policy-Value Learning for Recommendation" published at KDD 2020.
  ☆23Updated 2 years ago
• HarrieO / 2022-doubly-robust-LTR
  ☆9Updated 2 years ago
• rdspring1 / MISSION
  MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
  ☆13Updated 5 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• hpclab / efficient-query-expansion
  Official repository of "Efficient and Effective Query Expansion for Web Search", Short Paper @ CIKM 2018
  ☆15Updated 5 years ago