Lesson 2: Revisiting the Machine Learning Pipeline > Episode 5 - K-Nearest Neighbours Algorithm | Demystifying Machine Learning (COMP60028 Spring Term 2023/2024) | Department of Computing | Imperial College London

Lesson 2

Revisiting the Machine Learning Pipeline

Chapter : Lesson 2

Episode 5 - K-Nearest Neighbours Algorithm

face Josiah Wang

Summary:

K-Nearest Neighbours algorithm: Choose the most frequent label out of the $K$ most similar examples.
Increasing $K$ smoothens the decision boundary.