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 3 months ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆27Updated 6 years ago
• cemoody / flexi_hash_embedding
  PyTorch Flexible Hash Embeddings
  ☆28Updated 6 years ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆73Updated 5 years ago
• pisa-engine / BMP
  Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.
  ☆35Updated 3 weeks ago
• matteodellamico / flexible-clustering
  Clustering for arbitrary data and dissimilarity function
  ☆99Updated last year
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆40Updated 7 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 11 years ago
• gamboviol / miptree
  maximum inner product tree
  ☆26Updated 13 years ago
• criteo / Spark-RSVD
  Randomized SVD of large sparse matrices on Spark
  ☆77Updated 3 years ago
• lateral / poincare-embeddings
  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
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆61Updated last year
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆34Updated 8 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
• HazyResearch / anchor-stability
  A study of the downstream instability of word embeddings
  ☆12Updated 3 years ago
• VowpalWabbit / estimators
  Estimators to perform off-policy evaluation
  ☆13Updated last year
• cuMF / culda_cgs
  Efficient LDA solution on GPUs.
  ☆24Updated 7 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
• ZJULearning / RPLSH
  Kmeans Quantization + Random Projection based Locality Sensitive Hashing
  ☆31Updated 6 years ago
• facebookresearch / tbsm
  Time-based Sequence Model for Personalization and Recommendation Systems
  ☆49Updated 4 years ago
• berkeley-reclab / RecLab
  ☆67Updated 2 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆21Updated 5 years ago
• rjagerman / sigir2020
  Accelerated Confergence for Counterfactual Learning to Rank
  ☆17Updated 4 years ago
• apd10 / universal_memory_allocation
  ☆15Updated 3 years ago
• arapat / sparrow
  Sparrow is a boosting algorithm implementation that is optimized for training on very large datasets and/or in the limited memory setting…
  ☆21Updated 5 years ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆24Updated 5 years ago
• cloudml / SparkTree
  ☆14Updated 9 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
• hpclab / LtR-Tutorial
  Efficiency/Effectiveness Trade-offs in Learning to Rank
  ☆12Updated 7 years ago