Alternatives and similar repositories for FLINNG

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

• mwydmuch / napkinXC
  Extremely simple and fast extreme multi-class and multi-label classifiers.
  ☆70Updated last month
• 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
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 7 years ago
• pisa-engine / BMP
  Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.
  ☆31Updated last week
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 9 months ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆57Updated 2 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆60Updated last year
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆34Updated 6 years ago
• jjfiv / fastrank
  My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".
  ☆52Updated 9 months ago
• cemoody / flexi_hash_embedding
  PyTorch Flexible Hash Embeddings
  ☆28Updated 5 years ago
• HuangQiang / H2_ALSH
  Accurate and Fast ALSH for Maximum Inner Product Search (KDD 2018)
  ☆26Updated 4 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
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆59Updated 5 years ago
• criteo / Spark-RSVD
  Randomized SVD of large sparse matrices on Spark
  ☆77Updated 3 years ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 5 years ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆39Updated 5 months ago
• IBM / HOTT
  Code for NeurIPS 2019 paper "Hierarchical Optimal Transport for Document Representation"
  ☆54Updated 5 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆21Updated 5 years ago
• xmc-aalto / bonsai
  code for paper submission "Bonsai - Diverse and Shallow Trees for ExtremeMulti-label Classification"
  ☆29Updated 6 years ago
• hpclab / efficient-query-expansion
  Official repository of "Efficient and Effective Query Expansion for Web Search", Short Paper @ CIKM 2018
  ☆15Updated 6 years ago
• matteodellamico / flexible-clustering
  Clustering for arbitrary data and dissimilarity function
  ☆97Updated last year
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 11 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• HarrieO / OnlineLearningToRank
  ☆63Updated 5 years ago
• hpclab / LtR-Tutorial
  Efficiency/Effectiveness Trade-offs in Learning to Rank
  ☆12Updated 7 years ago
• gamboviol / miptree
  maximum inner product tree
  ☆26Updated 12 years ago
• TusKANNy / seismic
  Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. "Efficient Inverted Indexes for Approximate Retrieva…
  ☆100Updated last month
• olivierjeunen / dual-bandit-kdd-2020
  Source code for our paper "Joint Policy-Value Learning for Recommendation" published at KDD 2020.
  ☆23Updated 2 years ago
• mblondel / projection-losses
  Python implementation of projection losses.
  ☆27Updated 6 years ago