Alternatives and similar repositories for mtree

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

• erdavila / M-Tree
  A data structure for efficient nearest-neighbor queries.
  ☆73Updated last year
• lemire / lbimproved
  Dynamic Time Warping (DTW) library implementing lower bounds (LB_Keogh, LB_Improved...)
  ☆112Updated 5 years ago
• pthimon / clustering
  Library for performing spectral clustering in C++
  ☆79Updated 2 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• michaelchughes / KMeansRex
  Fast, vectorized C++ implementation of K-Means using the Eigen matrix template library. Includes Matlab and Python interfaces.
  ☆57Updated 8 years ago
• vioshyvo / mrpt
  Fast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search
  ☆263Updated last month
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 5 months ago
• manzilzaheer / CoverTree
  Cover Tree implementation in C++ for k-Nearest Neighbours and range search
  ☆95Updated 5 years ago
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆148Updated 11 months ago
• dsteinberg / libcluster
  An extensible C++ library of Hierarchical Bayesian clustering algorithms, such as Bayesian Gaussian mixture models, variational Dirichlet…
  ☆144Updated 7 years ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆23Updated last year
• mloskot / spatial_index_benchmark
  Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…
  ☆48Updated 6 years ago
• jstraub / dpMM
  Dirichlet Process Mixture Model sampling-based inference algorithms
  ☆14Updated 8 years ago
• avaneev / biteopt
  Derivative-Free Global Optimization Algorithm (C++, Python binding) - Continuous, Discrete, TSP, NLS, MINLP
  ☆160Updated 6 months ago
• ebattenberg / nmf-cuda
  A CUDA implementation of non-negative matrix factorization for GPUs.
  ☆34Updated 7 years ago
• jenniferjang / subsampled_neighborhood_graph_dbscan
  Subsampled Graph-Based DBSCAN
  ☆11Updated 4 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 11 years ago
• DNCrane / Cover-Tree
  A well-documented C++ implementation of the cover tree datastructure for quick k-nearest-neighbor search. Allows single-point insertion a…
  ☆62Updated 7 years ago
• decile-team / jensen
  A C++ toolkit for Convex Optimization (Logistic Loss, SVM, SVR, Least Squares etc.), Convex Optimization algorithms (LBFGS, TRON, SGD, Ad…
  ☆52Updated 3 years ago
• bmcfee / spatialtree
  Python module for spatial trees
  ☆37Updated 8 years ago
• ligmg / ligmg
  Parallel solver for graph Laplacians from large social networks.
  ☆11Updated 3 years ago
• mwydmuch / napkinXC
  Extremely simple and fast extreme multi-class and multi-label classifiers.
  ☆70Updated 4 months ago
• rth / pysofia
  bindings for the sofia-ml machine learning library
  ☆37Updated last year
• ipsarros / DolphinnPy
  High-dimensional approximate nearest neighbor in python
  ☆11Updated 6 years ago
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆94Updated 6 years ago
• ZJULearning / RPLSH
  Kmeans Quantization + Random Projection based Locality Sensitive Hashing
  ☆29Updated 6 years ago
• dhpark22 / collranking
  ☆13Updated 8 years ago
• lukas-shawford / rtreelib
  Pluggable R-tree implementation in pure Python.
  ☆63Updated 2 years ago
• arbenson / mrnmf
  Nonnegative matrix factorizations in MapReduce
  ☆24Updated 10 years ago
• ZJULearning / efanna
  fast library for ANN search and KNN graph construction
  ☆296Updated 7 years ago