Ateeq ur Rehman
 It is used for classification of data based on
nearest neighbour
 Prediction for test data is done K is an integer
(small), k=1 assign to the class of single nearest
neighbour
 The nearest neighbour is calculated based on
the distance
KNN LINEAR REGRESSION
 Non-linear
 Euclidean distance
 Linear
 Linear model
 Y=b0+b1 X
 K=1 make noise
 K=large not good(lost
of pattern)
 Equal distance
 K always be odd

ML KNN-ALGORITHM

  • 1.
  • 2.
     It isused for classification of data based on nearest neighbour  Prediction for test data is done K is an integer (small), k=1 assign to the class of single nearest neighbour  The nearest neighbour is calculated based on the distance
  • 4.
    KNN LINEAR REGRESSION Non-linear  Euclidean distance  Linear  Linear model  Y=b0+b1 X
  • 5.
     K=1 makenoise  K=large not good(lost of pattern)  Equal distance  K always be odd