Locality-Sensitive Hashing and Distribution Distances - Lecture 7

Learn advanced techniques for efficient similarity search and distance measurement in high-dimensional data through this 81-minute lecture from the University of Utah Data Science program. Master locality-sensitive hashing (LSH) by understanding how to combine hash functions with banding techniques to rapidly identify close pairs in large datasets. Explore specialized hash functions designed for angular/cosine similarity and Euclidean distance measurements. Dive into distribution distances including Kullback-Leibler divergence, Hellinger distance, and Wasserstein distance, gaining practical knowledge for comparing probability distributions in data science applications.