Coursera Plus Annual is 40% Off — Ends July 13.

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

Start learning Write review
DataCamp Ad

PowerBI Data Analyst - Create visualizations and dashboards from scratch

Learn More → Coursera Ad

AI, Data Science & Cloud Certificates from Google, IBM & Meta

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
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

Start learning

Never Stop Learning.

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

Sign up for free
Someone learning on their laptop while sitting on the floor.