Build KD-Trees and perform Nearest Neighbor searches
-
Updated
Mar 16, 2017 - C++
Build KD-Trees and perform Nearest Neighbor searches
Clustering wikipedia dataset based with K-NN by TF-IDF
A Python script to estimate the nearest neighbour distance and perform nearest neighbour Monte Carlo simulations
C++ implementation for machine learning algorithm K-NN
Using K Nearest Neighbours to predict target classes given a classified data set from a company! With hidden features column names.
Named after a charm in the Harry Potter Universe that allows the caster to summon an object, "accio" is a repo of Deep Learning and related codes for quick rolling and prototyping.
Python package providing nearest neighbor search (wraps ANN library)
Implementing various heuristics for Traveling Salesman Problem (TSP).
PathFinder - The best route is the shortest
Implements 3 types of interpolation: bicubic, bilinear and nearest-neighbor on black-and-white and color images of different sizes.
Iteratively declusters and replaces a randomised set of 2D points until a set is discovered where each point is separated by at least the specified minimum distance.
"Near Me" search API for exposing your geocoded tabular data
C++ Vantage Point Tree implementation with Python bindings
Nearest Neighbour Search with Variables on a Torus
Bisector tree implementation in OCaml
As part of the UCSanDiego online course "Machine Learning Fundamentals"
R package providing fast nearest neighbour search (wraps ANN library)
TiMBL implements several memory-based learning algorithms.
Add a description, image, and links to the nearest-neighbours topic page so that developers can more easily learn about it.
To associate your repository with the nearest-neighbours topic, visit your repo's landing page and select "manage topics."