tburette / mtreeLinks
M-tree datastructure to perform k-NN searches
☆26Updated 4 years ago
Alternatives and similar repositories for mtree
Users that are interested in mtree are comparing it to the libraries listed below
Sorting:
- A data structure for efficient nearest-neighbor queries.☆72Updated last year
- Cover Tree implementation in C++ for k-Nearest Neighbours and range search☆94Updated 5 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 9 months ago
- Alternating Directions Dual Decomposition☆69Updated 5 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- Fast, vectorized C++ implementation of K-Means using the Eigen matrix template library. Includes Matlab and Python interfaces.☆58Updated 8 years ago
- Fast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search☆268Updated 5 months ago
- Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…☆49Updated 6 years ago
- Extremely simple and fast extreme multi-class and multi-label classifiers.☆70Updated last month
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Updated 2 years ago
- A framework for building (and incrementally growing) graph-based data structures used in hierarchical or DAG-structured clustering and ne…☆43Updated 2 years ago
- Implementation of many similarity join algorithms.☆15Updated 11 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago
- Implementations of several fast approximate algorithms for geometric optimal transport (OT)☆117Updated 5 years ago
- Library for performing spectral clustering in C++☆80Updated 2 years ago
- Dynamic Time Warping (DTW) library implementing lower bounds (LB_Keogh, LB_Improved...)☆114Updated 5 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…☆70Updated 7 years ago
- Averaged Stochastic Gradient Descent Classifiers☆42Updated 13 years ago
- Probabilistic Sequence Mining☆46Updated 7 years ago
- fast kernel evaluation in high dimensions via hashing☆24Updated 5 years ago
- Python implementation of projection losses.☆27Updated 6 years ago
- Python module for spatial trees☆36Updated 8 years ago
- Kmeans Quantization + Random Projection based Locality Sensitive Hashing☆31Updated 6 years ago
- Kohonen vector quantizers (SOM, NG, GNG)☆71Updated 7 years ago
- Python bindings to Succinct Data Structure Library 2.0☆34Updated 6 years ago
- NumPy-compatible multidimensional arrays in C++☆163Updated last year
- An extensible C++ library of Hierarchical Bayesian clustering algorithms, such as Bayesian Gaussian mixture models, variational Dirichlet…☆144Updated 7 years ago
- A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.☆148Updated last year
- Parallel solver for graph Laplacians from large social networks.☆11Updated 3 years ago
- Simple implementation of CoveringLSH☆10Updated 9 years ago