Alternatives and similar repositories for FLINNG

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

• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆27Updated last month
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 4 years ago
• pisa-engine / BMP
  Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.
  ☆28Updated last month
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• daqcri / deeper-lite
  deep entity resolution lite version
  ☆11Updated 5 years ago
• cemoody / flexi_hash_embedding
  PyTorch Flexible Hash Embeddings
  ☆28Updated 5 years ago
• transformerdb / transformerdb
  TransformerDB
  ☆19Updated 4 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• rmit-ir / LTR_Cascade
  Code repo for the SIGIR '17 paper "Efficient Cost-Aware Cascade Ranking for Multi-Stage Retrieval"
  ☆10Updated 2 years ago
• olivierjeunen / dynamicindex
  C++ source code for the Dynamic Index algorithm proposed in "Efficient Similarity Computation for Collaborative Filtering in Dynamic Envi…
  ☆16Updated 5 years ago
• xinyandai / similarity-search
  A framework for index based similarity search.
  ☆19Updated 6 years ago
• karlhigley / ranking-metrics-torch
  Simple ranking metrics for PyTorch on CPU or GPU
  ☆15Updated 4 years ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆54Updated 4 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
• dferendo / RecommendationSystem
  ☆10Updated 4 years ago
• cuMF / culda_cgs
  Efficient LDA solution on GPUs.
  ☆24Updated 6 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• graindb / graindb
  ☆19Updated 3 years ago
• locuslab / ase
  Analogous Safe-state Exploration (ASE) is an algorithm for provably safe and optimal exploration in MDPs with unknown, stochastic dynamic…
  ☆11Updated 4 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 3 months ago
• HazyResearch / random_embedding
  ☆15Updated 3 years ago
• brj0 / nndescent
  C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search
  ☆22Updated 10 months ago
• ekzhu / set-similarity-search-benchmarks
  Benchmark Datasets for Set Similarity Search
  ☆12Updated 6 years ago
• HazyResearch / anchor-stability
  A study of the downstream instability of word embeddings
  ☆12Updated 2 years ago
• IlyaTrofimov / bb2vec
  This is the source code of the paper "Inferring Complementary Products from Baskets and Browsing Sessions"
  ☆11Updated 6 years ago
• lintool / JASS
  Anytime Ranking for Impact-Ordered Indexes
  ☆13Updated 8 years ago
• HarrieO / RankingComplexLayouts
  Repository for SIGIR'18 paper: "Ranking for Relevance and Display Preferences in Complex Presentation Layouts"
  ☆15Updated 6 years ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• pmineiro / elfcb
  Empirical Likelihood for Contextual Bandits
  ☆12Updated 4 years ago