Complexity for KNN algorithm and the Optimization for KNN search.
Time complexity
Space complexity
Time/space complexity for recurssive algorithm.
Master theorem for complexity analysis:
https://www.jianshu.com/p/ca2cc9c5703b
http://people.csail.mit.edu/thies/6.046-web/master.pdf
https://blog.csdn.net/lanchunhui/article/details/52451362
The Time complexity for KNN is O(N*D). N is the size of the training size and D is the dimension of the data.
1. Choose specific training sample from the training data set such as clustering
2. Approximate KNN algorithm, will lose the accuracy!
https://www.cs.umd.edu/~mount/ANN/
3. K-D tree search for low dimension data set
K-D Tree for KNN algorithm
Assu