Alternatives and similar repositories for mrpt

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

• ZJULearning / efanna
  fast library for ANN search and KNN graph construction
  ☆294Updated 7 years ago
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆66Updated 7 years ago
• manzilzaheer / CoverTree
  Cover Tree implementation in C++ for k-Nearest Neighbours and range search
  ☆95Updated 5 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆385Updated last year
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆94Updated 6 years ago
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆148Updated 11 months ago
• pixelogik / NearPy
  Python framework for fast (approximated) nearest neighbour search in large, high-dimensional data sets using different locality-sensitive…
  ☆768Updated 2 years ago
• lyst / rpforest
  It is a forest of random projection trees
  ☆224Updated 5 years ago
• src-d / minhashcuda
  Weighted MinHash implementation on CUDA (multi-gpu).
  ☆119Updated last year
• ryanrhymes / panns
  Python Approximate Nearest Neighbor Search in very high dimensional spaces with optimised indexing.
  ☆215Updated 3 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 5 months ago
• norouzi / mih
  Fast exact nearest neighbor search in Hamming distance on binary codes with Multi-index hashing
  ☆289Updated 9 years ago
• arbabenko / GNOIMI
  ☆160Updated 8 years ago
• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆154Updated last month
• una-dinosauria / local-search-quantization
  State-of-the-art method for large-scale ANN search as of Oct 2016. Presented at ECCV 16.
  ☆75Updated 7 years ago
• hdidx / hdidx
  Approximate Nearest Neighbor (ANN) search for high-dimensional data.
  ☆94Updated 6 years ago
• lisitsyn / tapkee
  A flexible and efficient С++ template library for dimension reduction
  ☆234Updated last year
• obachem / kmc2
  Cython implementation of k-MC2 and AFK-MC2 seeding
  ☆204Updated 3 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
• bmcfee / spatialtree
  Python module for spatial trees
  ☆37Updated 8 years ago
• ejaasaari / mrpt-comparison
  Performance comparison of the MRPT algorithm to other approximate nearest neighbor search libraries
  ☆27Updated 7 years ago
• YahooArchive / Optimal-LSH
  This package provides an efficient implementation of locality-sensitve hashing (LSH)
  ☆154Updated 13 years ago
• cgtuebingen / Product-Quantization-Tree
  GPU-based large scale Approx. Nearest Neighbor Search, accepted at CVPR 2016
  ☆92Updated 6 years ago
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆213Updated 5 years ago
• FALCONN-LIB / FALCONN
  FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)
  ☆1,153Updated last year
• 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
• RSIA-LIESMARS-WHU / LSHBOX
  A c++ toolbox of locality-sensitive hashing (LSH), provides several popular LSH algorithms, also support python and matlab.
  ☆288Updated 8 years ago
• Houzz / annoy2
  ☆26Updated 8 years ago
• arbabenko / MultiIndex
  Research code implementing inverted multiindex structure
  ☆84Updated 11 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