KNN: K-Nearest Neighbour

This is the story of a person found at JORDAN border, the country is surrounded by 5 neighbors, so how can we find the person belong to which country. KNN plays a vital role here,

Country having 5 neighbour

KNN is a algorithm which stores the whole model, i.e. it will never make any function. It will check the person with N numbers of countries who are neighbor to it. This algorithm has following names as it consider the whole sample set.

1-Instance-Based Learning

2-Lazy Learner


It is used for classification as well as regression problems. It works good for small data sets but hold problem when the dimensions increases and suffer from “Curse of Dimensionality

Lets Take the problem of Iris Data set,

#Load Basic Libraries

import numpy as np
import pandas as pd
from sklearn.datasets import load_iris
import seaborn as sns

iris=load_iris()–>150,4–>means 150 rows and 4 column

We can create a data frame like this,



from sklearn.neighbors import NearestNeighbors
nn = NearestNeighbors(5)
#The arguements specify to return the Fast 5 most among the #dataset


NearestNeighbors(algorithm='auto', leaf_size=30, metric='minkowski',
                 metric_params=None, n_jobs=None, n_neighbors=5, p=2,

The distance is of many types , please refer: here

In Order to predict a sample:

sample = np.array([[5.4,2,2,2.3]])


(array([[1.6673332 , 1.90525589, 1.94679223, 2.02484567, 2.09523268]]),
 array([[98, 93, 57, 60, 79]]))

print(df.ix[[98, 93, 23, 60, 79],])

So, 4 neighbors show it belongs to class1 and sample 23 states it belongs to class 0.

The probability of class is defines as:

Leave a Reply

Your email address will not be published. Required fields are marked *