Algorithms and data structures are used in various instances while building efficient Machine Learning models. In this video, we explore the “Divide and Conquer” technique and look at two examples where it is used in the context of Machine Learning.
The first example is that of the “K-Nearest Neighbours” with a Kd-Tree to make searching for the nearest neighbour efficient. The second example explores the bisection technique for finding the optimum of a convex function within a given domain.
