Alternatives and similar repositories for minhashcuda

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

• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 5 months ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆94Updated 6 years ago
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆213Updated 5 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 6 years ago
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆58Updated 3 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• cuMF / cumf_als
  CUDA Matrix Factorization Library with Alternating Least Square (ALS)
  ☆180Updated 7 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆385Updated last year
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆148Updated 11 months ago
• rapidsai / libgdf
  [ARCHIVED] C GPU DataFrame Library
  ☆139Updated 6 years ago
• rdspring1 / LSH_DeepLearning
  Scalable and Sustainable Deep Learning via Randomized Hashing
  ☆94Updated 3 years ago
• vioshyvo / mrpt
  Fast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search
  ☆263Updated 3 weeks ago
• cmdevries / LMW-tree
  Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering
  ☆76Updated 3 years ago
• ZJULearning / efanna
  fast library for ANN search and KNN graph construction
  ☆294Updated 7 years ago
• Houzz / annoy2
  ☆26Updated 8 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆150Updated 2 years ago
• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆154Updated last month
• norouzi / mih
  Fast exact nearest neighbor search in Hamming distance on binary codes with Multi-index hashing
  ☆289Updated 9 years ago
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆81Updated last year
• IntelLabs / pWord2Vec
  Parallelizing word2vec in shared and distributed memory
  ☆190Updated 2 years ago
• arbabenko / GNOIMI
  ☆160Updated 8 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 7 years ago
• piskvorky / sim-shootout
  Code for "Performance shootout between nearest-neighbour libraries": http://radimrehurek.com/2013/11/performance-shootout-of-nearest-neig…
  ☆99Updated 10 years ago
• ryanrhymes / panns
  Python Approximate Nearest Neighbor Search in very high dimensional spaces with optimised indexing.
  ☆215Updated 3 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 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
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆209Updated 4 years ago
• lyst / rpforest
  It is a forest of random projection trees
  ☆224Updated 5 years ago
• microsoft / distributed_skipgram_mixture
  Distributed skipgram mixture model for multisense word embedding
  ☆115Updated 9 years ago