Question: Which statement is TRUE for both k - NN and Decision tree algorithms? a ) They are highly prone to underfit. b ) Only one
Which statement is TRUE for both kNN and Decision tree algorithms?
a They are highly prone to underfit.
b Only one of them is a distance based algorithm.
c Scoring on test instance is fast with both algorithms.
d They are instance based learning methods.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
