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.
  ☆72Updated 9 months ago
• michaelchughes / KMeansRex
  Fast, vectorized C++ implementation of K-Means using the Eigen matrix template library. Includes Matlab and Python interfaces.
  ☆57Updated 7 years ago
• google / quickshift
  A clustering algorithm that first finds the high-density regions (cluster-cores) of the data and then clusters the remaining points by hi…
  ☆68Updated 6 years ago
• lemire / lbimproved
  Dynamic Time Warping (DTW) library implementing lower bounds (LB_Keogh, LB_Improved...)
  ☆112Updated 5 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…
  ☆50Updated 3 years ago
• takuti / stream-anomaly-detect
  Implementation of algorithms proposed by [Huang and Kasiviswanathan]
  ☆16Updated 8 years ago
• manzilzaheer / CoverTree
  Cover Tree implementation in C++ for k-Nearest Neighbours and range search
  ☆93Updated 4 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 10 years ago
• genbattle / dkm
  A generic C++11 k-means clustering implementation
  ☆211Updated 3 years ago
• mast-group / sequence-mining
  Probabilistic Sequence Mining
  ☆45Updated 6 years ago
• yoch / sparse-som
  Efficient Self-Organizing Map for Sparse Data
  ☆19Updated 4 years ago
• dsteinberg / libcluster
  An extensible C++ library of Hierarchical Bayesian clustering algorithms, such as Bayesian Gaussian mixture models, variational Dirichlet…
  ☆143Updated 6 years ago
• crishoj / OpenPNL
  Open Source Probabilistic Networks Library from Intel (with community contributions)
  ☆22Updated 14 years ago
• edoliberty / frequent-directions
  Implements the frequent directions algorithm for approximating matrices in streams
  ☆32Updated 7 years ago
• Treora / cdtw
  NumPy-based constrained Dynamic Time Warping (cDTW) module
  ☆12Updated 10 years ago
• PetterS / monolith
  A C++ monorepo for discrete and continuous optimization. Batteries included!
  ☆99Updated 10 months ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• maandree / hungarian-algorithm-n3
  [Complete] 𝓞(n³) implementation of the Hungarian algorithm
  ☆40Updated 4 years ago
• ContinuumIO / parallel_dbscan
  Python module for the parallel dbscan based on NWU code
  ☆18Updated 6 months ago
• patvarilly / CoverTree
  Python implementation of cover trees, near-drop-in replacement for scipy.spatial.kdtree
  ☆33Updated 12 years ago
• ilyaraz / ot_estimators
  Implementations of several fast approximate algorithms for geometric optimal transport (OT)
  ☆117Updated 4 years ago
• idiap / eakmeans
  Implementation of fast exact k-means algorithms
  ☆46Updated 5 years ago
• szairis / sakmapper
  Implementation of Mapper Algorithm
  ☆14Updated 8 years ago
• jnafzig / KalmanFlow
  A simple Kalman Filter built in TensorFlow
  ☆23Updated 7 years ago
• accosmin / nano
  C++ library [machine learning & numerical optimization] - superseeded by libnano
  ☆1Updated 6 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 3 weeks ago
• sods / paramz
  Parameterization Framework for parameterized model creation and handling.
  ☆48Updated last month
• lmcinnes / hdbscan_paper
  Source files and notebooks for a paper on accelerating HDBSCAN*
  ☆33Updated 7 years ago
• amgt-d1 / DPC
  Daichi Amagata and Takahiro Hara, SIGMOD2021
  ☆13Updated 10 months 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