In this video, I introduce a non-tree method for classification in K-Nearest Neighbors. I cover the idea of the algorithm and then bring in a brand new dataset to shake things up a bit.
LINKS AND INFO
Catallaxy Services - https://www.catallaxyservices.com
Keeping It Classy: Designing a Great Classifier -- https://www.catallaxyservices.com/presentations/keeping-it-classy/
Slide deck -- https://www.catallaxyservices.com/media/Keeping-It-Classy/
Demo code -- https://github.com/feaselkl/Keeping-It-Classy
Lecture 2: k-nearest neighbors -- https://www.cs.cornell.edu/courses/cs4780/2018fa/lectures/lecturenote02_kNN.html
K-Nearest Neighbors and the Curse of Dimensionality -- https://www.geeksforgeeks.org/k-nearest-neighbors-and-curse-of-dimensionality/
The Curse of Dimensionality - Dimension reduction -- https://dataloop.ai/blog/the-curse-of-dimensionality-dimension-reduction/