Alternatives and similar repositories for rii

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

• DwangoMediaVillage / pqkmeans
  Fast and memory-efficient clustering
  ☆263Updated 2 years ago
• matsui528 / annbench
  A lightweight benchmark for approximate nearest neighbor search
  ☆103Updated 2 years ago
• matsui528 / nanopq
  Pure python implementation of product quantization for nearest neighbor search
  ☆355Updated 6 months ago
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆217Updated 5 years ago
• facebookresearch / spreadingvectors
  Open source implementation of "Spreading Vectors for Similarity Search"
  ☆319Updated 4 years ago
• technicolor-research / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆61Updated 6 years ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 7 years ago
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆68Updated 7 years ago
• 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
• vioshyvo / mrpt
  Fast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search
  ☆268Updated 4 months ago
• arbabenko / GNOIMI
  ☆160Updated 9 years ago
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆94Updated 6 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 9 months ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 7 years ago
• hpclab / rankeval
  Official repository of RankEval: An Evaluation and Analysis Framework for Learning-to-Rank Solutions.
  ☆88Updated 5 years ago
• maumueller / ann-benchmarks
  Benchmarking approximate nearest neighbors. Note: This is an archived version from our SISAP 2017 paper, see below.
  ☆28Updated 7 years ago
• ZJULearning / efanna
  fast library for ANN search and KNN graph construction
  ☆298Updated 7 years ago
• src-d / minhashcuda
  Weighted MinHash implementation on CUDA (multi-gpu).
  ☆122Updated 2 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆67Updated 6 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆60Updated last year
• ThomasDelteil / VisualSearch_MXNet
  Visual Search using Apache MXNet and gluon
  ☆239Updated 6 years ago
• una-dinosauria / local-search-quantization
  State-of-the-art method for large-scale ANN search as of Oct 2016. Presented at ECCV 16.
  ☆74Updated 7 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
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆148Updated last year
• cemoody / flexi_hash_embedding
  PyTorch Flexible Hash Embeddings
  ☆28Updated 5 years ago
• YannDubs / Hash-Embeddings
  PyTorch implementation of Hash Embeddings (NIPS 2017). Submission to the NIPS Implementation Challenge.
  ☆204Updated 7 years ago
• hpclab / quickrank
  Official repository of QuickRank: A C++ suite of Learning to Rank algorithms.
  ☆131Updated 6 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 8 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆385Updated last year
• mpkato / interleaving
  A python library for conducting interleaving, which compares two or multiple rankers based on observed user clicks by interleaving their …
  ☆124Updated 4 years ago