1. K-NN algorithm does more computation on test time rather than train time
True, 因为要计算query与其他所有点之间的距离
2. 用decision tree表示Boolean function,可以先将真值表画出来
3. i.i.d
independent and identically distributed
1. K-NN algorithm does more computation on test time rather than train time
True, 因为要计算query与其他所有点之间的距离
2. 用decision tree表示Boolean function,可以先将真值表画出来
3. i.i.d
independent and identically distributed