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

Slide 14.1: k-nearest neighbors (kNN) algorithm
Slide 14.2: k-nearest neighbors (kNN) algorithm (cont.) (video: 4:42 minutes)
Slide 14.3: How k-nearest neighbors (kNN) algorithm works?
Slide 14.4: How k-nearest neighbors (kNN) algorithm works? (cont.)
Slide 14.5: A kNN numerical example (hand computation)
Slide 14.6: A kNN numerical example (cont.)
Slide 14.7: A kNN example for extrapolation, prediction, and forecasting
Slide 14.8: A kNN example for interpolation and smoothing
Slide 14.9: A kNN example for interpolation and smoothing (cont.)
Slide 14.10: How do we use the spreadsheet for kNN?
Slide 14.11: Strengths and weaknesses of kNN
Slide 14.12: An example of kNN using Sklearn

  ☂ References

Slide 14.ⓐ: 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.