Alternatives and similar repositories for RPLSH

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

• dmllr / fast-lopq
  Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximat…
  ☆35Updated 5 years ago
• ZJULearning / hashingSearch
  Search with a hash index
  ☆33Updated 6 years ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 6 years ago
• stanis-morozov / unq
  Supplementary Code for Unsupervised Neural Quantization for Compressed-Domain Similarity Search
  ☆36Updated 5 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆62Updated 6 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆39Updated 6 years ago
• xinyandai / product-quantization
  Implementation of vector quantization algorithms, codes for Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner P…
  ☆59Updated 4 years ago
• 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
  ☆33Updated 7 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆58Updated 10 months ago
• una-dinosauria / local-search-quantization
  State-of-the-art method for large-scale ANN search as of Oct 2016. Presented at ECCV 16.
  ☆75Updated 6 years ago
• fmaglia / BoI
  Multi-index hashing for the resolution of ANN search problem on large datasets
  ☆15Updated 6 years ago
• norouzi / ckmeans
  Cartesian k-means for approximate nearest neghbor search, codebook learning, etc.
  ☆51Updated 11 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
• technicolor-research / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆60Updated 6 years ago
• dbaranchuk / nns-meets-deep-rl
  Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning
  ☆21Updated 5 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• xinyandai / similarity-search
  A framework for index based similarity search.
  ☆19Updated 6 years ago
• arbabenko / Quantizations
  Source code for learning and evaluation different quantzation methods
  ☆26Updated 9 years ago
• hellozting / CompositeQuantization
  ☆31Updated 7 years ago
• wlzhao22 / tsdg
  TSDG: An efficient index graph for graph-based nearest neighbor search
  ☆9Updated 2 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆94Updated 5 years ago
• facebookresearch / supervised-hashing-baselines
  How should we evaluate supervised hashing
  ☆28Updated 6 years ago
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆66Updated 7 years ago
• doubling / Stochastic_Generative_Hashing
  ☆25Updated 6 years ago
• eelenberg / streak
  Interpreting neural networks via the STREAK algorithm (streaming weak submodular maximization)
  ☆23Updated 7 years ago
• technicolor-research / quick-adc
  Quick ADC
  ☆25Updated 6 years ago
• learning2hash / learning2hash.github.io
  Website for "Awesome Learning to Hash" https://learning2hash.github.io
  ☆18Updated 6 months ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆23Updated last year
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago