rpforest
Nearest neighbor search algorithm
An efficient algorithm for finding approximate nearest neighbors in high-dimensional spaces
It is a forest of random projection trees
225 stars
18 watching
43 forks
Language: Python
last commit: over 6 years agoLinked from 1 awesome list
Related projects:
| Repository | Description | Stars |
|---|---|---|
| A library for efficient searching of high-dimensional data points using graph and tree-based methods | 1,272 | |
| Fast 2D nearest neighbor search with an angle | 7 | |
| A Julia package for efficient nearest neighbor searches in high-dimensional spaces | 426 | |
| An implementation of the K Nearest Neighbour algorithm in Ruby, allowing users to query a dataset and retrieve the k most similar data points based on various distance measurements. | 37 | |
| A high-performance approximate nearest neighbors search library for Ruby | 52 | |
| Provides Ruby bindings for a C++ library implementing approximate nearest neighbor search | 15 | |
| A data structure and search algorithm for finding closest points in high-dimensional space | 13,321 | |
| A Ruby wrapper around the Annoy C++ library for efficient nearest neighbor searches | 34 | |
| A data structure library for finding nearest neighbors in a general metric space | 31 | |
| A Python implementation of federated optimization algorithm with normalized annealing regularization. | 6 | |
| An efficient spatial index implementation for nearest neighbor search in n-dimensional spaces | 419 | |
| A JavaScript implementation of the k-nearest neighbors algorithm for supervised machine learning | 48 | |
| An implementation of graph-based approximate nearest neighbor search algorithms | 32 | |
| An efficient data structure library for fast geospatial indexing and nearest neighbor searches | 236 | |
| Recurrent neural network model for predicting people's next location based on spatial and temporal features | 28 |