Scribd
Upload
1K views

KNN Numerical Example

Uploaded by

jaspinjose
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
1K views

KNN Numerical Example

Uploaded by

jaspinjose
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

(https://people.revoledu.

com/kardi/)

MENU

KNN Numerical Example (hand


computation)

By Kardi Teknomo, PhD (../../copyright.html) .

(purchase.html)

< Previous (HowTo_KNN.html) | Next (KNN_TimeSeries.htm) | Contents (index.html) >

Read it off line on any device. Click here to purchase the complete E-book of this tutorial
(purchase.html)

Numerical Exampe of K Nearest Neighbor Algorithm


Here is step by step on how to compute K-nearest neighbors KNN algorithm:

1. Determine parameter K = number of nearest neighbors


2. Calculate the distance between the query-instance and all the training samples
3. Sort the distance and determine nearest neighbors based on the K-th minimum
distance
4. Gather the category of the nearest neighbors
5. Use simple majority of the category of nearest neighbors as the prediction value of the
query instance

We will use again the previous example (WhatisKNN.html) to calculate KNN by hand
computation. If you want to download the MS excel companion of this tutorial, click here
(purchase.html)
Example

We have data from the questionnaires survey (to ask people opinion) and objective testing
with two attributes (acid durability and strength) to classify whether a special paper tissue
is good or not. Here is four training samples

X2 = Strength
X1 = Acid Durability (seconds) Y = Classification
(kg/square meter)

7 7 Bad

7 4 Bad

3 4 Good

1 4 Good

Now the factory produces a new paper tissue that pass laboratory test with X1 = 3 and X2 =
7. Without another expensive survey, can we guess what the classification of this new
tissue is?

1. Determine parameter K = number of nearest neighbors

Suppose use K = 3

2. Calculate the distance between the query-instance and all the training samples

Coordinate of query instance is (3, 7), instead of calculating the distance we compute
square distance which is faster to calculate (without square root)

X2 = Strength
X1 = Acid Durability (seconds) Square Distance to query instance (3, 7)
(kg/square meter)

7 7

7 4

3 4

1 4
3. Sort the distance and determine nearest neighbors based on the K-th minimum distance

X2 = Strength
X1 = Acid
Square Distance to Rank minimum Is it included in 3-
Durability
(kg/square query instance (3, 7) distance Nearest neighbors?
(seconds)
meter)

7 7 3 Yes

7 4 4 No

3 4 1 Yes

1 4 2 Yes

4. Gather the category of the nearest neighbors. Notice in the second row last column
that the category of nearest neighbor (Y) is not included because the rank of this data is
more than 3 (=K).

X2 =
X1 = Acid Strength Square Distance Rank Is it included in Y = Category of
Durability to query minimum 3-Nearest nearest
(seconds) (kg/square instance (3, 7) distance neighbors? Neighbor
meter)

7 7 3 Yes Bad

7 4 4 No -

3 4 1 Yes Good

1 4 2 Yes Good

5. Use simple majority of the category of nearest neighbors as the prediction value of the
query instance

We have 2 good and 1 bad, since 2>1 then we conclude that a new paper tissue that pass
laboratory test with X1 = 3 and X2 = 7 is included in Good category.

Read it off line on any device. Click here to purchase the complete E-book of this tutorial
(purchase.html)
Give your feedback and rate this tutorial (../Rating/RateTutorial.php?TutorialName=KNN)

< Previous (HowTo_KNN.html) | Next (KNN_TimeSeries.htm) | Contents (index.html) >

This tutorial is copyrighted (../../copyright.html) .

Preferable reference for this tutorial is

Teknomo, Kardi. K-Nearest Neighbors Tutorial.


https:\\people.revoledu.com\kardi\tutorial\KNN\

Copyright © 2017 Kardi Teknomo


Revoledu Design

You might also like