Gain insights into data science with easy-to-follow, hands-on explanations. Explore essential concepts quickly and efficiently, even without prior statistics knowledge, for a career boost.

GrokkingDataScientist.tar.gz

jupyter_job

Master the skills that can get you a $100K+ salary even if you bunked your statistics classes. 

No need to waste hours and hours on browsing from one article to the next and piecing together the info you need to grasp important topics. No need to get overwhelmed by the information overload. Find easy to follow, hands-on, and fun explanations of all the essential topics in one place so you can quickly and efficiently learn what you need to thrive as a data scientist.

"Is this course right for me?" Continue to read to decide for yourself!

- "I want to understand this data science concept. Let me Google it". Then after hours of surfing, reading random articles, and invoking the heavens, you are more confused than before.
- "Data science is the sexiest and highest paying job of the 21st century. I want to become a data scientist too".
- "I have a basic knowledge of Python, willingness to learn, and commitment to become a great data scientist."

Is that you? If yes, you are at the right place.

Grokking Data Science

### 6. K-Nearest Neighbors (KNN)
KNN algorithm is a very simple and popular technique. It is based on the following idea from real life: ***You are the average of the five people you most associate with!***

KNN classifies an object by searching through the entire training set for the *k* most similar instances, the *k* neighbors, and assigning a common output variable to all those *k* instances. The figure below represents a classification example. The test sample (green dot) should be classified either to blue squares or to red triangles. If *k = 3* (solid line circle) it is assigned to the red triangles because there are 2 triangles and only 1 square inside the inner circle. If *k = 5* (dashed line circle) it is assigned to the blue squares (3 squares vs. 2 triangles inside the outer circle):

# 6. K-Nearest Neighbors (KNN)
KNN algorithm is a very simple and popular technique. It is based on the following idea from real life: ***You are the average of the five people you most associate with!***

KNN classifies an object by searching through the entire training set for the *k* most similar instances, the *k* neighbors, and assigning a common output variable to all those *k* instances. The figure below represents a classification example. The test sample (green dot) should be classified either to blue squares or to red triangles. If *k = 3* (solid line circle) it is assigned to the red triangles because there are 2 triangles and only 1 square inside the inner circle. If *k = 5* (dashed line circle) it is assigned to the blue squares (3 squares vs. 2 triangles inside the outer circle):

Python Fundamentals for Data Science

The Fundamentals of Statistics

Machine Learning 101

End-to-End Machine Learning Project

The Real Talk

Machine Learning Algorithms II

6. K-Nearest Neighbors (KNN)