This program will approximate the Traveling salesman problem using 3 three different algorithms (Nearest Neighbot, 2Opt, and 3Opt). There are 6 different combinations and each can be run individually or in suite as part of a benchmark test.

A full-featured indoor positioning system that was developed during my master thesis. It has a javascript based rich UI and has a server-client architecture.

Simple implementation of spatial skyline query algorithms

A generic vantage point tree (vp-tree) implementation in Java

Closy is a library that provides fast and generic solutions for nearest neighbor search (NNS)

A memory-resident geospatial index library for Java

Handwriting recognition using several algorithms - NN,KNN, and neural networks (with back propogation)

AI final project to classify ASCII art digits and faces. Implemented various fundamental machine learning algorithms such as K-Nearest Neighbors, Naive Bayes, and Perceptron. 5-Nearest Neighbors was more than 90% accurate on 1000 test digits and 150 test faces using 6000 digits and 752 faces as training samples respectively.

PH-Tree

This is an android app which predict the GPA of student using given data. This app uses K-nearest neighour to predict GPA.

Use KD-trees and Locality Sensitive Hashing (LSH) to find exact and approximate nearest neighbor

Utilization of some basic algorithms for the recogniton of one of the Iris plants among the three existing (Setosa, Versicolor, Virginica) using Java Object Oriented.