Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of Locality Sensitive Hashing (LSH) for nearest neighbor search, discussing submodularity and collision probability in hash functions. The instructor explains the preprocessing steps, hash function selection, and the minimization of set functions. The lecture also delves into the properties of submodular set functions and their applications in minimizing ground set functions.