[MINI] k-Nearest Neighbors episode artwork

EPISODE · Jul 24, 2015 · 8 MIN

[MINI] k-Nearest Neighbors

from Data Skeptic

This episode explores the k-nearest neighbors algorithm which is an unsupervised, non-parametric method that can be used for both classification and regression. The basica concept is that it leverages some distance function on your dataset to find the $k$ closests other observations of the dataset and averaging them to impute an unknown value or unlabelled datapoint.

Episode metadata supplied by the publisher feed · Published Jul 24, 2015

Embed this episode

Ready to play

[MINI] k-Nearest Neighbors

0:00 8:33

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Data Skeptic?

This episode is 8 minutes long.

When was this Data Skeptic episode published?

This episode was published on July 24, 2015.

Can I download this Data Skeptic episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!