Question
What is a major computational disadvantage of basic k-NN at prediction time?
Select an option. Your answer will be checked instantly.
Correct Answer: C. It may need to compute distances to many stored training observations
Explanation:
A naive neighbor search compares each new case with all training cases. Prediction can therefore become slow and memory-intensive for very large datasets.
Leave a Reply