A VP-tree based nearest neighbor search engine written in Python.

=Abstract= The traveling salesman problem (TSP) is a well-known NP-complete problem. It has appeared in diverse field of human knowledge. Different heuristics have been developed to generate approximate solutions for TSP. In this project, we are using 3 different heuristics for TSP to implement a h...

AI Algorithm Platform -- a series of AI agorithms, including convex hull, nearest neighbor, pathfinding and concollision detection. (Written in C#) We both develop some classic algorithms, and some new algorithms based on our M2M Model, which is an new approach to implement these algorithms effic...

kdtree is a simple, easy to use C library for working with kd-trees. Kd-trees are an extension of binary search trees to k-dimensional data. They facilitate very fast searching, and nearest-neighbor queries. This particular implementation is designed to be efficient and very easy to use. It is...

Source Codes of Exercises in CMSC 170 on Digit Classification for Machine-generated and single and multiple handwritten digits by Daryl Ancheta and Paul Andrew Manuales, UPLB BS Computer Science students of Sir Vladimir Mariano. The following exercises used a total of 200 training samples(20 for ...

The STANN library contains source code for constructiong k-nearest neighbor graphs and geometric minimum spanning trees in parallel.

Nearest Neighbor Pattern Classification with Cam Weighted Distance and Statistical Confidence optimizations.