Build KD-Trees and perform Nearest Neighbor searches
-
Updated
Mar 16, 2017 - C++
Build KD-Trees and perform Nearest Neighbor searches
A graph-based approximate nearest neighbor search algorithms implementation
High Dimensional Approximate Near(est) Neighbor
mlpack: a scalable C++ machine learning library
Fast search algorithm for product-quantized codes via hash-tables
Optimizes Semi-External Memory Tree Operations for machine learning
Multi-index hashing for the resolution of ANN search problem on large datasets
The Travelling Salesman Problem in C++
C++ implementation of KDTree & kNN classification on MNIST
Python wrapper for Boost Geometry Rtree
ocaml binding for FALCONN
Simple tests for MRPT algorithm
An implementation for an approximation algorithm for Ward's method
Fast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search
Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximate nearest neighbor search of high dimensional data.
Assignments for Course COL362 -Database Management Systems at IIT Delhi
A collection of libraries implementing Locality Sensitive Hashing (LSH), Clustering, and Applications of it.
Add a description, image, and links to the nearest-neighbor-search topic page so that developers can more easily learn about it.
To associate your repository with the nearest-neighbor-search topic, visit your repo's landing page and select "manage topics."