Alternatives and similar repositories for similarity-search

Users that are interested in similarity-search are comparing it to the libraries listed below

• xinyandai / product-quantization
  Implementation of vector quantization algorithms, codes for Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner P…
  ☆59Updated 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
• cuMF / culda_cgs
  Efficient LDA solution on GPUs.
  ☆24Updated 7 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• apd10 / universal_memory_allocation
  ☆15Updated 3 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆59Updated last year
• NLPrinceton / sparse_recovery
  noiseless/nonnegative sparse recovery and feature retrieval via compressed sensing
  ☆39Updated 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
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆39Updated 4 months ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆23Updated last year
• ZJULearning / RPLSH
  Kmeans Quantization + Random Projection based Locality Sensitive Hashing
  ☆30Updated 6 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 8 years ago
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆94Updated 6 years ago
• ramkikannan / planc
  Distributed NMF/NTF Library
  ☆51Updated 11 months ago
• gibranfp / Sampled-MinHashing
  A method to mine beyond-pairwise relationships using Min-Hashing for large-scale pattern discovery
  ☆27Updated 4 years ago
• lijinf2 / losha
  Distributed similarity search
  ☆10Updated 5 years ago
• HuangQiang / H2_ALSH
  Accurate and Fast ALSH for Maximum Inner Product Search (KDD 2018)
  ☆26Updated 4 years ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆167Updated 9 months ago
• mwydmuch / napkinXC
  Extremely simple and fast extreme multi-class and multi-label classifiers.
  ☆70Updated 2 weeks ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 7 years ago
• stanis-morozov / prodige
  A supplementary code for Beyond Vector Spaces: Compact Data Representation as Differentiable Weighted Graphs.
  ☆47Updated 6 years ago
• hp027 / AliGraph
  Large Scale Graphical Model
  ☆24Updated 6 years ago
• adefazio / sampler
  Dynamic weighted sampling with replacement
  ☆14Updated 9 years ago
• ZJULearning / AtSNE
  Anchor-t-SNE for large-scale and high-dimension vector visualization
  ☆57Updated 6 years ago
• jenniferjang / subsampled_neighborhood_graph_dbscan
  Subsampled Graph-Based DBSCAN
  ☆11Updated 5 years ago
• usyd-fsalab / NeuralNetworkRandomness
  ☆14Updated 3 years ago
• gamboviol / miptree
  maximum inner product tree
  ☆26Updated 12 years ago
• edoliberty / frequent-directions
  Implements the frequent directions algorithm for approximating matrices in streams
  ☆33Updated 8 years ago
• Abhishaike / HyperProtoNetReproduce
  NeurIPS 2019 Paper Implementation
  ☆12Updated 3 years ago