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
• 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
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• mwydmuch / napkinXC
  Extremely simple and fast extreme multi-class and multi-label classifiers.
  ☆70Updated last month
• cemoody / flexi_hash_embedding
  PyTorch Flexible Hash Embeddings
  ☆28Updated 5 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 7 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 9 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 9 months ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆34Updated 6 years ago
• criteo / Spark-RSVD
  Randomized SVD of large sparse matrices on Spark
  ☆77Updated 3 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
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 8 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 11 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆57Updated 2 years ago
• matteodellamico / flexible-clustering
  Clustering for arbitrary data and dissimilarity function
  ☆97Updated last year
• olivierjeunen / dual-bandit-kdd-2020
  Source code for our paper "Joint Policy-Value Learning for Recommendation" published at KDD 2020.
  ☆23Updated 2 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆21Updated 5 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆60Updated last year
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 7 years ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆39Updated 5 months ago
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆61Updated 3 years ago
• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆153Updated 5 months ago
• VowpalWabbit / estimators
  Estimators to perform off-policy evaluation
  ☆13Updated last year
• cuMF / culda_cgs
  Efficient LDA solution on GPUs.
  ☆24Updated 7 years ago
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆148Updated last year
• HazyResearch / anchor-stability
  A study of the downstream instability of word embeddings
  ☆12Updated 3 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
• xinyandai / similarity-search
  A framework for index based similarity search.
  ☆19Updated 6 years ago
• facebookresearch / tbsm
  Time-based Sequence Model for Personalization and Recommendation Systems
  ☆49Updated 4 years ago
• gamboviol / miptree
  maximum inner product tree
  ☆26Updated 12 years ago