Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Data Mining: Nearest Neighbor Search Using KD-Trees, LSH and Graph-Based Descent - Lecture 9

UofU Data Science via YouTube

Overview

Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Learn about advanced nearest neighbor search techniques in this university lecture covering three key approaches: kd-trees for spatial partitioning, Locality-Sensitive Hashing (LSH) for approximate nearest neighbor search, and graph-based descent methods for efficient similarity searches.

Syllabus

Data Mining Lecture 9 - ANN

Taught by

UofU Data Science

Reviews

Start your review of Data Mining: Nearest Neighbor Search Using KD-Trees, LSH and Graph-Based Descent - Lecture 9

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.