Multidimensional Data, Video 7 K d Tree Nearest Finding

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

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

Thank you, your video is the first one I found that truly explains how to find deterministicly find the nearest neighbour, and not just probabilisticly.

vellyxenya
Автор

you are the best, you have explained the algorithm as simple as possible, one day inshaa lallah i'll be able to expalined as good as you

ayoubrayanemesbah
Автор

Thanks, best k-d tree video I've found so far.

erik....
Автор

Thank you Josh! That's a very clear and detailed explanation :)

Jeremylinnn
Автор

Very clear explanation especially on pruning the unpromising spaces! Thanks!

klausdupont
Автор

Hi Josh, I think we should check the RIGHT SIDE of C ... what if C and E are really close?

MONSTR
Автор

This is such a clear explanation! Thank you very much :)

karlrombauts
Автор

such an intuitive explanation to a complex data structure. thanks

theendurance
Автор

That was really good. Even made fun following the video

deeppant
Автор

Hello Josh!
I'm trying to figure out now for over 20h how I could implement the down-up step recursively.
Doing the up-down is kinda easy but when I wanna walk up and check the other nodes recursively, I always end in an endless recursion loop.
Could you provide me a pseudo code for the down-up step? That would totally make my day! :)

patrice
Автор

12:33 Hi Josh.. what are you trying to say here? very confused.

scm