Data Efficient kNN for Online Algorithms

kNN algorithm uses "neighbor" data points for estimation. In online algorithms, with constrant stream of new data points generated, k nearest neighbors (and hence the estimation) are updated. However, ideally, online algorithms are expected to store limited data, not the infinite stream of data. The goal of this project is to test different ways of making online kNN data efficient while maintaining the estimation accuracy.