NGT
Data search library
A library for efficient searching of high-dimensional data points using graph and tree-based methods
Nearest Neighbor Search with Neighborhood Graph and Tree for High-dimensional Data
1k stars
38 watching
116 forks
Language: C++
last commit: 2 months ago
Linked from 1 awesome list
approximate-nearest-neighbor-searchk-nearest-neighborsknn-searchnearest-neighbor-searchnearest-neighbors
Related projects:
Repository | Description | Stars |
---|---|---|
| Fast 2D nearest neighbor search with an angle | 7 |
| A Julia package for efficient nearest neighbor searches in high-dimensional spaces | 426 |
| An efficient algorithm for finding approximate nearest neighbors in high-dimensional spaces | 225 |
| Provides Ruby bindings for a C++ library implementing approximate nearest neighbor search | 15 |
| A high-performance approximate nearest neighbors search library for Ruby | 52 |
| An implementation of graph-based approximate nearest neighbor search algorithms | 32 |
| A Ruby wrapper around the Annoy C++ library for efficient nearest neighbor searches | 34 |
| A data structure and search algorithm for finding closest points in high-dimensional space | 13,321 |
| A C++ library for efficient nearest neighbor search with KD-trees | 2,269 |
| A JavaScript implementation of the k-nearest neighbors algorithm for supervised machine learning | 48 |
| An implementation of a K-Nearest Neighbor algorithm for supervised learning | 7 |
| A data structure library for finding nearest neighbors in a general metric space | 31 |
| A full-text search engine and column store designed to be embeddable in other applications. | 803 |
| An efficient spatial data structure for fast point query operations | 43 |
| A utility to search for phrases in a tree data structure | 16 |