Python Machine Learning Tutorial #6 - KNN p.2 - How does K Nearest Neighbors Work?

preview_player
Показать описание
So how does k nearest neighbors work? In this python machine learning tutorial I explain and illustrate how the K-nearest neighbors algorithm works. I explain euclidean distance and how points are classified and talk about the pros and cons of this algorithm.

**************************************************************

Use the Code "SAVE6144" For 50% Off!

**************************************************************

Please leave a LIKE and SUBSCRIBE for more content!

Tags:
- Tech With Tim
- Python Tutorials
- Machine learning tutorial
- Python machine learning
- Python machine learning tutorial
- Pickle python
- Saving models
- Matplotlib tutorial
Рекомендации по теме
Комментарии
Автор

Thank god I actually paid attention in math, I always thought it was useless, turns out its crucial for machine learning and making these algorithms a whole lot easier to understand. Thanks for the videos mate keep it up!

VS-tlbc
Автор

5:45 What about you get the 5 nearest neighbours to be 2 greens, 2 blues and 1 red?
You can also have a tie in terms of distance if the data uses enough big units, and so you have no nearest point but rather nearest two points for example.

ahmedouerfelli
Автор

Was not familiar with this algorithm, thanks for the in depth tutorials. 👍

HostDotPromo
Автор

Another great video in the series. This video makes clear the difference between nearest neighbor and linear progression algos. I'm excited to begin implementing these into a ML stock trading bot and I understand now the importance of learning the math behind these algos.

JoaquinRoibal
Автор

This Channel deserves more subs and likes

mandiprai
Автор

This is the best Machine learning tutorials I watched so far

AhmedAdel
Автор

Bro I am so glad I found these videos.

coltonfarley
Автор

You explain this better than my teachers in uni 100%

agnedragunaite
Автор

Great tutorial! Trying to find my way in ML, these first steps are so easy with a teacher like you! Cheers mate

wikaka
Автор

This is awesome. Need to understand this for my UG research. Keep it up👍

zavdiel
Автор

Is it just me, or does he just look and sound like the friendly version of Eminem?

davidchen
Автор

Me as a red-green colorblind person be like: "yes, the black dot defently belongs to the red/green group and it defenetly does not belong to the red/green group" *cries in black & white*

fabse
Автор

This is the most useful and effective tutorial I've ever used! But, wait a minute... How old are you, young blood??
You are kinda stunning!

yapadqoi
Автор

Very nice tutorial in these Corona times, thank you very much!

grenouliusYT
Автор

Great videos so far, keep up the great work. Thanks ☺

shinstorm
Автор

Add on to that, we could use cross validation to find the best k value from our testing data set

richardyang
Автор

you are explaining so good. If we pick k=9 and our point is closest to 3 points from each colour e.g: red, green, orange, what's the result?

ionutdrg
Автор

hi tim, thank you for all your tutorial

mohammadtorkashvand
Автор

5:34 TECH WITH TIM! You said "a odd number" INSTEAD OF "an odd number."

YOU FAILED ME!!!!




















































































































































































































JK LOL I love ur videos

troys
Автор

What if you pick an odd number but you still get a draw?

simopelle
visit shbcf.ru