kNN.15 K-d tree algorithm

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

this was so exciting it was like reporting from a live supervolcano.

bestelectronicmusicfromnew
Автор

@ 2:55 I think the tree formation is wrong, it says x2>=4 for left child and x2>=8 for right child, however the pictorial view says, it will be y2 instead of x2. I think the pictorial view is correct.

mubashwir
Автор

This algorithm doesn't work in duplicate median values.
Consider that the point (5, 4) is (6, 4). this will produce an unbalanced tree (left elements < right elements).

aladdinnawasreh
Автор

HI Victor, thanks for the great videos. You mentioned the depth of the trees is no greater than log2(N) which in this example works out at 3.321. Does this figure represent the number of decision nodes i.e. X1>=6, X2 >= 4 and X2>=8? Or does it refer to the sum of one of the blue branches and the two green branches? Thanks again.

tighthead