Talk:K-nearest neighbor algorithm
From Wikipedia, the free encyclopedia
I will write a more complete article for this when the exam season has passed.
Are there not any weighted kNN algorithms, that will take (to some degree) the actual distances into account? If the 5 closest neighbors are 0.1, 4000, 10000, 20000 and 55570 units away, we might say the very close first match has more importance than the others.
So what is the complexity of kNN? I'm guessing O(n^2) but I'm not 100 % sure...
[edit] refly to other something.....
Comoplexly of kNN is O(n^2). I think so "It's guess" Complexly of NNS(Nearest Neighbor Search) is O(nlogn) on the KB-tree, finding one item.
I'm studing a kNN in multiple nodes. so I made Hk-NN is called by kNN. Processing time reduced effectively. I need to share and discussion in order to find out better Hk-NN method. I don't know cost of kNN, and anyone who are known cost did nothing but guessing.
If you known kNN's processing cost with accuracy, please send a message by the mail.
My e-mail: hanjjon@gmail.com
