Complexity Analysis with K-D Tree Data Structure
发布时间
阅读量：
阅读量
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
<>
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.
还没有任何评论哟~