Alternatives and similar repositories for mrpt:

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

• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆64Updated 7 years ago
• lyst / rpforest
  It is a forest of random projection trees
  ☆224Updated 5 years ago
• ZJULearning / efanna
  fast library for ANN search and KNN graph construction
  ☆288Updated 7 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆386Updated 11 months ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 2 weeks ago
• ejaasaari / mrpt-comparison
  Performance comparison of the MRPT algorithm to other approximate nearest neighbor search libraries
  ☆27Updated 7 years ago
• manzilzaheer / CoverTree
  Cover Tree implementation in C++ for k-Nearest Neighbours and range search
  ☆93Updated 4 years ago
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆93Updated 5 years ago
• dmllr / fast-lopq
  Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximat…
  ☆34Updated 4 years ago
• DwangoMediaVillage / pqkmeans
  Fast and memory-efficient clustering
  ☆256Updated last year
• cgtuebingen / Product-Quantization-Tree
  GPU-based large scale Approx. Nearest Neighbor Search, accepted at CVPR 2016
  ☆91Updated 6 years ago
• ryanrhymes / panns
  Python Approximate Nearest Neighbor Search in very high dimensional spaces with optimised indexing.
  ☆214Updated 3 years ago
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆146Updated 6 months ago
• pixelogik / NearPy
  Python framework for fast (approximated) nearest neighbour search in large, high-dimensional data sets using different locality-sensitive…
  ☆767Updated 2 years ago
• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆154Updated last year
• bmcfee / spatialtree
  Python module for spatial trees
  ☆37Updated 7 years ago
• facebookresearch / spreadingvectors
  Open source implementation of "Spreading Vectors for Similarity Search"
  ☆319Updated 3 years ago
• src-d / minhashcuda
  Weighted MinHash implementation on CUDA (multi-gpu).
  ☆117Updated last year
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆60Updated 5 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.
  ☆75Updated 6 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
• arrayfire / arrayfire-ml
  ArrayFire's Machine Learning Library.
  ☆103Updated 6 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• idiap / eakmeans
  Implementation of fast exact k-means algorithms
  ☆46Updated 5 years ago
• lisitsyn / tapkee
  A flexible and efficient С++ template library for dimension reduction
  ☆233Updated 9 months ago
• FALCONN-LIB / FALCONN
  FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)
  ☆1,148Updated 9 months ago
• IntelLabs / pWord2Vec
  Parallelizing word2vec in shared and distributed memory
  ☆190Updated 2 years ago
• obachem / kmc2
  Cython implementation of k-MC2 and AFK-MC2 seeding
  ☆203Updated 3 years ago
• arbabenko / MultiIndex
  Research code implementing inverted multiindex structure
  ☆83Updated 11 years ago
• lmcinnes / pynndescent
  A Python nearest neighbor descent for approximate nearest neighbors
  ☆916Updated 4 months ago