Sebastian Raschka
@sebastianraschka·88.6K subscribers·307 videos
2.4 Big O of K-nearest neighbors (L02: Nearest Neighbor Methods)
Posted
September 8, 2020
Views
6,853
Likes
87
Comments
8
Engagement
September 8, 2020
6,853
87
8
1.39%
Every word spoken in this episode is indexed. Type any phrase to jump straight to the moment it was said.
Type any word or phrase that may have been spoken. Click a result to seek the player to that exact moment.
Try a name, a topic, or a quoted line
38:24Now PlayingSebastian's books
In this video, we are looking at the Big-O runtime complexity of a naive implementation of k-nearest neighbors
-------
This video is part of my Introduction of Machine Learning course.
The complete playlist
A handy overview page with links to the materials
-------
If you want to be notified about future videos, please consider subscribing to my channel
Sentinel Indexing in Progress
Metadata and chapters are available. Claim extraction for this episode is pending.
All video content is delivered via YouTube embedded players in accordance with the YouTube Terms of Service. Sentinel provides research tools that promote discovery and accountability across political media.
