Concept guide · Classical algorithms
What is k-nearest neighbours and what are its weaknesses?
A slower explanation for when the short interview answer is not enough. Start with the intuition, then connect it to the technical idea and the way an interviewer expects you to reason about it.
ML area
Classical algorithms → Core interview concept
Interview format
Core
Question
ML-052
Start with the idea
In simple terms
This question is asking you to explain What is k-nearest neighbours and what are its weaknesses in a way that connects the idea to a real machine-learning decision. Start with the role this concept plays, then explain what changes when the data, target, or deployment situation changes.
Build the answer
How to reason about it
- 1Define the concept before naming algorithms or implementation details.
- 2Connect it to the data, target, decision, or failure mode in the question.
- 3State the assumption or evaluation check that would make the explanation trustworthy.
Go one level deeper
The technical explanation
k-nearest neighbours predicts from the labels of the closest training examples under a chosen distance. It is simple and non-parametric, but prediction can be expensive because it searches the training set, and the result is highly sensitive to feature scaling, irrelevant dimensions, the distance metric, and the choice of k. In high dimensions, distances often become less informative. The safest way to understand this topic is to connect the definition to assumptions, data available at prediction time, the decision it supports, and how you would evaluate whether the result is useful.
Say this in the interview
k-nearest neighbours predicts from the labels of the closest training examples under a chosen distance. It is simple and non-parametric, but prediction can be expensive because it searches the training set, and the result is highly sensitive to feature scaling, irrelevant dimensions, the distance metric, and the choice of k. In high dimensions, distances often become less informative.
Keep preparing