This repository contains the material used to complete my Thesis for my BSc in Data Science and AI. My thesis attempts to explore the work started by previous alumni at my faculty which covered an algorithm variant of MCTS implementing a technique known as Sequential Halving, and I formulate an algorithm version not requiring constraints.

Anytime Lazy kNN: A fast anytime kNN search algorithm that assesses only true kNN candidates in a lazy fashion.

Julia implementation of RRT* motion planning algorithm.

Julia Implementation of Anytime Weighted A* (AWA*) and Randomized Weighted A* (RWA*) algorithm

Implementation of various anytime motion planning algorithms

A model-free metareasoning library for interrupting and adjusting the parameters of anytime algorithms.

Code for ABC-APTMC paper

An experimental framework for monitoring and controlling anytime algorithms with online performance prediction

This project is made to demonstrate the capabilities of anytime algorithms in order to continually improve on solutions for NP hard programs through the ability to be stopped at any time.

An anytime implementation of scikit-learn GridSearchCV

An application that gathers streaming data from twitter dataset , uses feature selection techniques to extract relevant keywords from a tweet , performs clustering to detect events . It also takes input from user such that window specified by user allows to further perform clustering which in turn uses a forest data structure to achieve it.