tburette / mtree
M-tree datastructure to perform k-NN searches
☆26Updated 3 years ago
Alternatives and similar repositories for mtree:
Users that are interested in mtree are comparing it to the libraries listed below
- A data structure for efficient nearest-neighbor queries.☆72Updated 9 months ago
- Fast, vectorized C++ implementation of K-Means using the Eigen matrix template library. Includes Matlab and Python interfaces.☆57Updated 7 years ago
- 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
- Dynamic Time Warping (DTW) library implementing lower bounds (LB_Keogh, LB_Improved...)☆112Updated 5 years ago
- A C++ toolkit for Convex Optimization (Logistic Loss, SVM, SVR, Least Squares etc.), Convex Optimization algorithms (LBFGS, TRON, SGD, Ad…☆50Updated 3 years ago
- Implementation of algorithms proposed by [Huang and Kasiviswanathan]☆16Updated 8 years ago
- Cover Tree implementation in C++ for k-Nearest Neighbours and range search☆93Updated 4 years ago
- Implementation of many similarity join algorithms.☆15Updated 10 years ago
- A generic C++11 k-means clustering implementation☆211Updated 3 years ago
- Probabilistic Sequence Mining☆45Updated 6 years ago
- Efficient Self-Organizing Map for Sparse Data☆19Updated 4 years ago
- An extensible C++ library of Hierarchical Bayesian clustering algorithms, such as Bayesian Gaussian mixture models, variational Dirichlet…☆143Updated 6 years ago
- Open Source Probabilistic Networks Library from Intel (with community contributions)☆22Updated 14 years ago
- Implements the frequent directions algorithm for approximating matrices in streams☆32Updated 7 years ago
- NumPy-based constrained Dynamic Time Warping (cDTW) module☆12Updated 10 years ago
- A C++ monorepo for discrete and continuous optimization. Batteries included!☆99Updated 10 months ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 9 years ago
- [Complete] 𝓞(n³) implementation of the Hungarian algorithm☆40Updated 4 years ago
- Python module for the parallel dbscan based on NWU code☆18Updated 6 months ago
- Python implementation of cover trees, near-drop-in replacement for scipy.spatial.kdtree☆33Updated 12 years ago
- Implementations of several fast approximate algorithms for geometric optimal transport (OT)☆117Updated 4 years ago
- Implementation of fast exact k-means algorithms☆46Updated 5 years ago
- Implementation of Mapper Algorithm☆14Updated 8 years ago
- A simple Kalman Filter built in TensorFlow☆23Updated 7 years ago
- C++ library [machine learning & numerical optimization] - superseeded by libnano☆1Updated 6 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 3 weeks ago
- Parameterization Framework for parameterized model creation and handling.☆48Updated last month
- Source files and notebooks for a paper on accelerating HDBSCAN*☆33Updated 7 years ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆13Updated 10 months ago
- 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