Developments in KD Tree and KNN Searches

Abstract

KNN (K-nearest neighbor) is an important tool in machine learning and it is used in classification and prediction problems.In recent years several modified versions of KNN search algorithm have been developed and employed to improve the efficiency of search.KNN has enormous real life applications and is widely used in data mining.Data structures like KD tree (or K dimensional tree) are used for implementing KNN effectively.A KD tree is a multidimensional binary search tree that can be balanced or unbalanced.With the increase in dimension of space the computational time of KNN-KD search goes high.Certain modifications that can help in improvising the search time has been developed in recent years.

Topics & Concepts