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 11 months ago
- How fast can we shuffle values?☆37Updated last year
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 9 years 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
- Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…☆47Updated 5 years ago
- Implementation of many similarity join algorithms.☆15Updated 11 years ago
- SIMD-enabled descriptive statistics (mean, variance, covariance, correlation)☆18Updated 2 weeks ago
- A C++ toolkit for Convex Optimization (Logistic Loss, SVM, SVR, Least Squares etc.), Convex Optimization algorithms (LBFGS, TRON, SGD, Ad…☆51Updated 3 years ago
- Python library for declarative, constrained, structured-output prediction.☆21Updated last year
- tiny fast portable real-time deep neural network for regression and classification within 50 LOC.☆50Updated 4 years ago
- Spatial Containers, Pareto Fronts, and Pareto Archives☆97Updated 10 months ago
- Cover Tree implementation in C++ for k-Nearest Neighbours and range search☆93Updated 4 years ago
- Derivative-Free Global Optimization Algorithm (C++, Python binding) - Continuous, Discrete, TSP, NLS, MINLP☆151Updated 2 months ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated last month
- EASEA (EAsy Specification of Evolutionary Algorithms) is an Artificial Evolution platform developped by the SONIC (Stochastic Optimisati…☆18Updated last year
- Comparing the performance of Python, NumPy and C extensions☆40Updated 6 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
- High Dimensional Approximate Near(est) Neighbor☆33Updated 7 years ago
- Fast, vectorized C++ implementation of K-Means using the Eigen matrix template library. Includes Matlab and Python interfaces.☆57Updated 7 years ago
- A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!☆48Updated 2 weeks ago
- Python wrapper around SVDLIBC, a fast library for sparse Singular Value Decomposition☆55Updated 11 years ago
- Python implementation of cover trees, near-drop-in replacement for scipy.spatial.kdtree☆33Updated 13 years ago
- ADWIN is an adaptive sliding window algorithm for detecting change and keeping updated statistics from a data stream, and use it as a bla…☆39Updated 7 years ago
- C++ library [machine learning & numerical optimization] - superseeded by libnano☆1Updated 6 years ago
- Dynamic Time Warping code in C/C++☆22Updated 12 years ago
- A library for exploring persistent homology☆100Updated 2 years ago
- Implementation of maximum branching algorithm (max spanning tree in directed graphs)☆25Updated 3 years ago
- A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.☆23Updated 7 years ago
- A framework for building (and incrementally growing) graph-based data structures used in hierarchical or DAG-structured clustering and ne…☆44Updated 2 years ago
- A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF☆16Updated last year