The following slides introduce the k-nearest neighbors (kNN) algorithm.

Slide 13.1: k-nearest neighbors (kNN) algorithm
Slide 13.2: k-nearest neighbors (kNN) algorithm (cont.)
Slide 13.3: How k‐nearest neighbors (kNN) algorithm works?
Slide 13.4: How k-nearest neighbors (kNN) algorithm works? (cont.)
Slide 13.5: A kNN numerical example (hand computation)
Slide 13.6: A kNN numerical example (cont.)
Slide 13.7: A kNN example for extrapolation, prediction, and forecasting
Slide 13.8: A kNN example for interpolation and smoothing
Slide 13.9: A kNN example for interpolation and smoothing (cont.)
Slide 13.10: How do we use the spreadsheet for kNN?
Slide 13.11: Strengths and weaknesses of kNN
Slide 13.12: A kNN application using scikit-learn

  ☂ References

Slide 13.a: k-nearest neighbors






      Judge: State your name.    
      Me: Not Guilty    
      Judge: What?    
      Me: I had it legally changed.    
      Judge: You’re Not Guilty?    
      Me: Thanks, I’m outta here.