flann
Nearest neighbor search library
A fast and efficient algorithm for finding the nearest neighbors in high-dimensional spaces
Fast Library for Approximate Nearest Neighbors
2k stars
79 watching
646 forks
Language: C++
last commit: about 2 years agoLinked from 1 awesome list
arbox/machine-learning-with-rubyRelated projects:
| Repository | Description | Stars |
|---|---|---|
 erikbern/ann-benchmarks | A comprehensive benchmarking framework for evaluating the performance of approximate nearest neighbor search libraries in Python. | 5,013 |
 nmslib/nmslib | An efficient similarity search library and toolkit for evaluation of k-NN methods in generic non-metric spaces | 3,429 |
 microsoft/sptag | A distributed approximate nearest neighbor search library | 4,840 |
 norlab-ulaval/libnabo | A fast K Nearest Neighbor library for low-dimensional spaces | 452 |
 whenever5225/graphanns | An implementation of graph-based approximate nearest neighbor search algorithms | 32 |
 jlblancoc/nanoflann | A C++ library for efficient nearest neighbor search with KD-trees | 2,269 |
 yoshoku/hnswlib.rb | Provides Ruby bindings for a C++ library implementing approximate nearest neighbor search | 15 |
 lyst/rpforest | An efficient algorithm for finding approximate nearest neighbors in high-dimensional spaces | 225 |
 kristofferc/nearestneighbors.jl | A Julia package for efficient nearest neighbor searches in high-dimensional spaces | 426 |
| yoshoku/annoy-rb | A Ruby wrapper around the Annoy C++ library for efficient nearest neighbor searches | 34 |
 bast/flanders | Fast 2D nearest neighbor search with an angle | 7 |
 evgenykarkan/ekalgorithms | A collection of exercises and examples showcasing various algorithms, data structures, and software concepts in Objective-C. | 2,421 |
 yahoojapan/ngt | A library for efficient searching of high-dimensional data points using graph and tree-based methods | 1,272 |
 dbalatero/levenshtein-ffi | Fast string edit distance computation using the Damerau-Levenshtein algorithm | 150 |
 spotify/annoy | A data structure and search algorithm for finding closest points in high-dimensional space | 13,321 |